./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_product28.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product28.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 da76b57a1451220816a27c40b8cda655a945b2081fe69d46a431c484896fab87 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:31:54,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:31:54,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:31:54,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:31:54,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:31:54,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:31:54,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:31:54,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:31:54,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:31:54,239 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:31:54,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:31:54,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:31:54,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:31:54,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:31:54,242 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:31:54,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:31:54,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:31:54,243 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:31:54,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:31:54,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:31:54,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:31:54,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:31:54,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:31:54,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:31:54,246 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:31:54,246 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:31:54,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:31:54,247 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:31:54,247 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:31:54,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:31:54,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:31:54,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:31:54,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:31:54,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:31:54,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:31:54,248 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:31:54,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:31:54,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:31:54,248 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:31:54,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:31:54,249 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:31:54,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:31:54,257 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-clean/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-clean/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 -> da76b57a1451220816a27c40b8cda655a945b2081fe69d46a431c484896fab87 [2024-10-11 02:31:54,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:31:54,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:31:54,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:31:54,490 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:31:54,490 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:31:54,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product28.cil.c [2024-10-11 02:31:55,772 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:31:56,059 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:31:56,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product28.cil.c [2024-10-11 02:31:56,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ffe6bda5f/0a9718be37f54b5fb08cb232d14e33e0/FLAG24e4d9b46 [2024-10-11 02:31:56,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ffe6bda5f/0a9718be37f54b5fb08cb232d14e33e0 [2024-10-11 02:31:56,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:31:56,339 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:31:56,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:31:56,340 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:31:56,344 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:31:56,345 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:31:56" (1/1) ... [2024-10-11 02:31:56,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@731b62f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:56, skipping insertion in model container [2024-10-11 02:31:56,346 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:31:56" (1/1) ... [2024-10-11 02:31:56,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:31:56,717 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_product28.cil.c[43703,43716] [2024-10-11 02:31:56,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:31:56,808 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:31:56,816 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2024-10-11 02:31:56,817 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification14_spec.i","") [86] [2024-10-11 02:31:56,817 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [131] [2024-10-11 02:31:56,817 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [252] [2024-10-11 02:31:56,818 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1852] [2024-10-11 02:31:56,818 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1870] [2024-10-11 02:31:56,818 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2220] [2024-10-11 02:31:56,819 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [2229] [2024-10-11 02:31:56,819 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2320] [2024-10-11 02:31:56,819 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2981] [2024-10-11 02:31:56,862 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_product28.cil.c[43703,43716] [2024-10-11 02:31:56,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:31:56,905 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:31:56,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:56 WrapperNode [2024-10-11 02:31:56,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:31:56,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:31:56,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:31:56,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:31:56,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:56" (1/1) ... [2024-10-11 02:31:56,933 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:56" (1/1) ... [2024-10-11 02:31:56,986 INFO L138 Inliner]: procedures = 94, calls = 341, calls flagged for inlining = 28, calls inlined = 24, statements flattened = 1103 [2024-10-11 02:31:56,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:31:56,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:31:56,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:31:56,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:31:57,000 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:56" (1/1) ... [2024-10-11 02:31:57,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:56" (1/1) ... [2024-10-11 02:31:57,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:56" (1/1) ... [2024-10-11 02:31:57,042 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 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-11 02:31:57,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:56" (1/1) ... [2024-10-11 02:31:57,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:56" (1/1) ... [2024-10-11 02:31:57,062 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:56" (1/1) ... [2024-10-11 02:31:57,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:56" (1/1) ... [2024-10-11 02:31:57,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:56" (1/1) ... [2024-10-11 02:31:57,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:56" (1/1) ... [2024-10-11 02:31:57,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:31:57,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:31:57,111 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:31:57,111 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:31:57,112 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:56" (1/1) ... [2024-10-11 02:31:57,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:31:57,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:31:57,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:31:57,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:31:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:31:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-11 02:31:57,187 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-11 02:31:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-11 02:31:57,187 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-11 02:31:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:31:57,188 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:31:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-10-11 02:31:57,188 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-10-11 02:31:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:31:57,189 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:31:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-10-11 02:31:57,189 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-10-11 02:31:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:31:57,189 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:31:57,190 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:31:57,190 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:31:57,190 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:31:57,190 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:31:57,191 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-11 02:31:57,191 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-11 02:31:57,191 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:31:57,191 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:31:57,191 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:31:57,191 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:31:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:31:57,192 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:31:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-11 02:31:57,193 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-11 02:31:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:31:57,193 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:31:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2024-10-11 02:31:57,193 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2024-10-11 02:31:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:31:57,193 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:31:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:31:57,193 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:31:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:31:57,194 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:31:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:31:57,194 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:31:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:31:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:31:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:31:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:31:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:31:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:31:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:31:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:31:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:31:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:31:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:31:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:31:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:31:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:31:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:31:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:31:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:31:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:31:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:31:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:31:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:31:57,196 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:31:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:31:57,197 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:31:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:31:57,197 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:31:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:31:57,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:31:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:31:57,197 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:31:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2024-10-11 02:31:57,197 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2024-10-11 02:31:57,345 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:31:57,348 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:31:58,410 INFO L? ?]: Removed 453 outVars from TransFormulas that were not future-live. [2024-10-11 02:31:58,410 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:31:58,472 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:31:58,473 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:31:58,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:31:58 BoogieIcfgContainer [2024-10-11 02:31:58,473 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:31:58,475 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:31:58,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:31:58,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:31:58,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:31:56" (1/3) ... [2024-10-11 02:31:58,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40498fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:31:58, skipping insertion in model container [2024-10-11 02:31:58,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:56" (2/3) ... [2024-10-11 02:31:58,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40498fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:31:58, skipping insertion in model container [2024-10-11 02:31:58,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:31:58" (3/3) ... [2024-10-11 02:31:58,482 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product28.cil.c [2024-10-11 02:31:58,496 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:31:58,496 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:31:58,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:31:58,577 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;@141083c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:31:58,577 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:31:58,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 532 states, 408 states have (on average 1.7083333333333333) internal successors, (697), 426 states have internal predecessors, (697), 97 states have call successors, (97), 25 states have call predecessors, (97), 25 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-11 02:31:58,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 02:31:58,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:31:58,597 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:31:58,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:31:58,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:31:58,602 INFO L85 PathProgramCache]: Analyzing trace with hash -734151109, now seen corresponding path program 1 times [2024-10-11 02:31:58,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:31:58,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195380320] [2024-10-11 02:31:58,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:31:58,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:31:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:59,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:31:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:59,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:31:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:59,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:31:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:59,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:31:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:59,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:31:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:59,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:31:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:59,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:31:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:59,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:31:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:31:59,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:31:59,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195380320] [2024-10-11 02:31:59,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195380320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:31:59,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:31:59,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:31:59,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138199572] [2024-10-11 02:31:59,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:31:59,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:31:59,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:31:59,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:31:59,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:31:59,325 INFO L87 Difference]: Start difference. First operand has 532 states, 408 states have (on average 1.7083333333333333) internal successors, (697), 426 states have internal predecessors, (697), 97 states have call successors, (97), 25 states have call predecessors, (97), 25 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:02,335 INFO L93 Difference]: Finished difference Result 1180 states and 1999 transitions. [2024-10-11 02:32:02,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:02,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2024-10-11 02:32:02,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:02,355 INFO L225 Difference]: With dead ends: 1180 [2024-10-11 02:32:02,355 INFO L226 Difference]: Without dead ends: 646 [2024-10-11 02:32:02,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:32:02,366 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 642 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:02,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 1470 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 02:32:02,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-10-11 02:32:02,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 531. [2024-10-11 02:32:02,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 408 states have (on average 1.6911764705882353) internal successors, (690), 425 states have internal predecessors, (690), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 02:32:02,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 883 transitions. [2024-10-11 02:32:02,526 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 883 transitions. Word has length 52 [2024-10-11 02:32:02,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:02,526 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 883 transitions. [2024-10-11 02:32:02,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:02,527 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 883 transitions. [2024-10-11 02:32:02,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 02:32:02,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:02,530 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:02,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:32:02,530 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:02,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:02,531 INFO L85 PathProgramCache]: Analyzing trace with hash 473576812, now seen corresponding path program 1 times [2024-10-11 02:32:02,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:02,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327028713] [2024-10-11 02:32:02,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:02,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:02,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:02,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:02,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:32:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:02,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:32:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:02,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:32:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:02,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:02,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:32:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:02,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:32:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:02,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:02,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:02,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327028713] [2024-10-11 02:32:02,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327028713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:02,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:02,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:32:02,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317400494] [2024-10-11 02:32:02,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:02,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:02,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:02,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:02,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:32:02,804 INFO L87 Difference]: Start difference. First operand 531 states and 883 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:05,281 INFO L93 Difference]: Finished difference Result 1165 states and 1950 transitions. [2024-10-11 02:32:05,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:32:05,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 53 [2024-10-11 02:32:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:05,288 INFO L225 Difference]: With dead ends: 1165 [2024-10-11 02:32:05,289 INFO L226 Difference]: Without dead ends: 646 [2024-10-11 02:32:05,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:32:05,292 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 635 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:05,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 1570 Invalid, 1801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 02:32:05,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-10-11 02:32:05,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 531. [2024-10-11 02:32:05,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 408 states have (on average 1.6887254901960784) internal successors, (689), 425 states have internal predecessors, (689), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 02:32:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 882 transitions. [2024-10-11 02:32:05,407 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 882 transitions. Word has length 53 [2024-10-11 02:32:05,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:05,407 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 882 transitions. [2024-10-11 02:32:05,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 882 transitions. [2024-10-11 02:32:05,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 02:32:05,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:05,410 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:05,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:32:05,410 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:05,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:05,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1179985193, now seen corresponding path program 1 times [2024-10-11 02:32:05,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:05,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553944983] [2024-10-11 02:32:05,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:05,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:05,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:05,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:05,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:32:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:05,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:32:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:05,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:32:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:05,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:05,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:32:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:05,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:32:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:05,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:05,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:05,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553944983] [2024-10-11 02:32:05,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553944983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:05,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:05,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:32:05,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183702759] [2024-10-11 02:32:05,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:05,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:05,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:05,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:05,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:32:05,674 INFO L87 Difference]: Start difference. First operand 531 states and 882 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:07,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:07,785 INFO L93 Difference]: Finished difference Result 1165 states and 1949 transitions. [2024-10-11 02:32:07,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:32:07,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2024-10-11 02:32:07,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:07,790 INFO L225 Difference]: With dead ends: 1165 [2024-10-11 02:32:07,790 INFO L226 Difference]: Without dead ends: 646 [2024-10-11 02:32:07,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:32:07,793 INFO L432 NwaCegarLoop]: 513 mSDtfsCounter, 633 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 1692 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:07,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1574 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1692 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 02:32:07,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-10-11 02:32:07,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 531. [2024-10-11 02:32:07,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 408 states have (on average 1.6862745098039216) internal successors, (688), 425 states have internal predecessors, (688), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 02:32:07,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 881 transitions. [2024-10-11 02:32:07,851 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 881 transitions. Word has length 54 [2024-10-11 02:32:07,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:07,852 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 881 transitions. [2024-10-11 02:32:07,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:07,852 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 881 transitions. [2024-10-11 02:32:07,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 02:32:07,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:07,854 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:07,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:32:07,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:07,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:07,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1339221688, now seen corresponding path program 1 times [2024-10-11 02:32:07,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:07,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285100535] [2024-10-11 02:32:07,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:07,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:08,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:08,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:08,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 02:32:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:08,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:32:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:08,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:32:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:08,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:08,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:32:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:08,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:32:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:08,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:08,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:08,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285100535] [2024-10-11 02:32:08,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285100535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:08,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:08,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:32:08,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088066211] [2024-10-11 02:32:08,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:08,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:08,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:08,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:08,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:32:08,137 INFO L87 Difference]: Start difference. First operand 531 states and 881 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:10,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:10,356 INFO L93 Difference]: Finished difference Result 1165 states and 1948 transitions. [2024-10-11 02:32:10,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:32:10,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2024-10-11 02:32:10,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:10,360 INFO L225 Difference]: With dead ends: 1165 [2024-10-11 02:32:10,360 INFO L226 Difference]: Without dead ends: 646 [2024-10-11 02:32:10,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:32:10,367 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 631 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 1453 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:10,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 1453 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 02:32:10,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-10-11 02:32:10,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 531. [2024-10-11 02:32:10,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 408 states have (on average 1.6838235294117647) internal successors, (687), 425 states have internal predecessors, (687), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 02:32:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 880 transitions. [2024-10-11 02:32:10,416 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 880 transitions. Word has length 55 [2024-10-11 02:32:10,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:10,417 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 880 transitions. [2024-10-11 02:32:10,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:10,418 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 880 transitions. [2024-10-11 02:32:10,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 02:32:10,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:10,419 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:10,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:32:10,420 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:10,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:10,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1875959667, now seen corresponding path program 1 times [2024-10-11 02:32:10,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:10,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72210242] [2024-10-11 02:32:10,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:10,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:32:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:32:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:32:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 02:32:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:32:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:10,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:10,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72210242] [2024-10-11 02:32:10,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72210242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:10,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:10,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:32:10,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601419695] [2024-10-11 02:32:10,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:10,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:10,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:10,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:10,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:32:10,675 INFO L87 Difference]: Start difference. First operand 531 states and 880 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:12,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:12,904 INFO L93 Difference]: Finished difference Result 1165 states and 1947 transitions. [2024-10-11 02:32:12,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:32:12,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2024-10-11 02:32:12,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:12,910 INFO L225 Difference]: With dead ends: 1165 [2024-10-11 02:32:12,910 INFO L226 Difference]: Without dead ends: 646 [2024-10-11 02:32:12,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:32:12,915 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 629 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1453 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:12,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1453 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 02:32:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-10-11 02:32:12,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 531. [2024-10-11 02:32:12,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 408 states have (on average 1.6813725490196079) internal successors, (686), 425 states have internal predecessors, (686), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 02:32:12,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 879 transitions. [2024-10-11 02:32:12,974 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 879 transitions. Word has length 56 [2024-10-11 02:32:12,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:12,974 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 879 transitions. [2024-10-11 02:32:12,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:12,975 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 879 transitions. [2024-10-11 02:32:12,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 02:32:12,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:12,976 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:12,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:32:12,976 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:12,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:12,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1971055324, now seen corresponding path program 1 times [2024-10-11 02:32:12,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:12,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538576046] [2024-10-11 02:32:12,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:12,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:13,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:13,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:13,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:13,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:32:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:13,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:13,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:13,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:32:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:13,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:32:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:13,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:13,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538576046] [2024-10-11 02:32:13,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538576046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:13,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:13,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:32:13,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782728982] [2024-10-11 02:32:13,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:13,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:32:13,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:13,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:32:13,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:32:13,298 INFO L87 Difference]: Start difference. First operand 531 states and 879 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:16,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:16,381 INFO L93 Difference]: Finished difference Result 1185 states and 1981 transitions. [2024-10-11 02:32:16,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 02:32:16,381 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 57 [2024-10-11 02:32:16,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:16,385 INFO L225 Difference]: With dead ends: 1185 [2024-10-11 02:32:16,385 INFO L226 Difference]: Without dead ends: 670 [2024-10-11 02:32:16,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:32:16,388 INFO L432 NwaCegarLoop]: 511 mSDtfsCounter, 720 mSDsluCounter, 2429 mSDsCounter, 0 mSdLazyCounter, 3368 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 2940 SdHoareTripleChecker+Invalid, 3476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 3368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:16,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 2940 Invalid, 3476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 3368 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 02:32:16,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-10-11 02:32:16,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 543. [2024-10-11 02:32:16,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 417 states have (on average 1.6786570743405276) internal successors, (700), 436 states have internal predecessors, (700), 98 states have call successors, (98), 26 states have call predecessors, (98), 27 states have return successors, (100), 94 states have call predecessors, (100), 97 states have call successors, (100) [2024-10-11 02:32:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 898 transitions. [2024-10-11 02:32:16,453 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 898 transitions. Word has length 57 [2024-10-11 02:32:16,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:16,453 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 898 transitions. [2024-10-11 02:32:16,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:16,453 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 898 transitions. [2024-10-11 02:32:16,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 02:32:16,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:16,454 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:16,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:32:16,454 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:16,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:16,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1140564675, now seen corresponding path program 1 times [2024-10-11 02:32:16,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:16,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091459438] [2024-10-11 02:32:16,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:16,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:16,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:16,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:16,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:16,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:32:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:16,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:16,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:16,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:32:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:16,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:32:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:16,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:16,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091459438] [2024-10-11 02:32:16,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091459438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:16,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:16,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:32:16,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153699378] [2024-10-11 02:32:16,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:16,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:16,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:16,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:16,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:32:16,678 INFO L87 Difference]: Start difference. First operand 543 states and 898 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:18,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:18,781 INFO L93 Difference]: Finished difference Result 1236 states and 2069 transitions. [2024-10-11 02:32:18,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:32:18,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2024-10-11 02:32:18,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:18,786 INFO L225 Difference]: With dead ends: 1236 [2024-10-11 02:32:18,786 INFO L226 Difference]: Without dead ends: 713 [2024-10-11 02:32:18,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:32:18,789 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 700 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1872 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:18,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 1400 Invalid, 1988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1872 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 02:32:18,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-10-11 02:32:18,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 562. [2024-10-11 02:32:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 435 states have (on average 1.6735632183908047) internal successors, (728), 454 states have internal predecessors, (728), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-10-11 02:32:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 925 transitions. [2024-10-11 02:32:18,866 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 925 transitions. Word has length 57 [2024-10-11 02:32:18,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:18,866 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 925 transitions. [2024-10-11 02:32:18,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:18,866 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 925 transitions. [2024-10-11 02:32:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 02:32:18,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:18,867 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:18,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:32:18,869 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:18,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:18,869 INFO L85 PathProgramCache]: Analyzing trace with hash -265325259, now seen corresponding path program 1 times [2024-10-11 02:32:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:18,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539392417] [2024-10-11 02:32:18,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:18,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:19,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:19,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:19,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:19,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:32:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:19,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:32:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:19,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:19,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:32:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:19,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:32:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:19,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:19,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539392417] [2024-10-11 02:32:19,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539392417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:19,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:19,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:32:19,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868922549] [2024-10-11 02:32:19,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:19,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:19,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:19,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:19,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:32:19,069 INFO L87 Difference]: Start difference. First operand 562 states and 925 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:20,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:20,915 INFO L93 Difference]: Finished difference Result 1211 states and 2004 transitions. [2024-10-11 02:32:20,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:20,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2024-10-11 02:32:20,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:20,919 INFO L225 Difference]: With dead ends: 1211 [2024-10-11 02:32:20,919 INFO L226 Difference]: Without dead ends: 705 [2024-10-11 02:32:20,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:20,922 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 688 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:20,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 1406 Invalid, 1967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 02:32:20,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-11 02:32:20,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 562. [2024-10-11 02:32:20,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 435 states have (on average 1.6620689655172414) internal successors, (723), 454 states have internal predecessors, (723), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-10-11 02:32:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 920 transitions. [2024-10-11 02:32:20,968 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 920 transitions. Word has length 58 [2024-10-11 02:32:20,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:20,969 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 920 transitions. [2024-10-11 02:32:20,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:20,969 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 920 transitions. [2024-10-11 02:32:20,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 02:32:20,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:20,970 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:20,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:32:20,970 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:20,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:20,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1216690872, now seen corresponding path program 1 times [2024-10-11 02:32:20,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:20,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695504786] [2024-10-11 02:32:20,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:20,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:32:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:32:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:32:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:32:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:21,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:21,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695504786] [2024-10-11 02:32:21,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695504786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:21,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:21,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:32:21,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232782728] [2024-10-11 02:32:21,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:21,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:21,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:21,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:21,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:32:21,211 INFO L87 Difference]: Start difference. First operand 562 states and 920 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:23,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:23,064 INFO L93 Difference]: Finished difference Result 1211 states and 1999 transitions. [2024-10-11 02:32:23,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:23,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 59 [2024-10-11 02:32:23,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:23,068 INFO L225 Difference]: With dead ends: 1211 [2024-10-11 02:32:23,068 INFO L226 Difference]: Without dead ends: 705 [2024-10-11 02:32:23,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:23,070 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 687 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 1837 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 1947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:23,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 1410 Invalid, 1947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1837 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 02:32:23,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-11 02:32:23,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 562. [2024-10-11 02:32:23,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 435 states have (on average 1.650574712643678) internal successors, (718), 454 states have internal predecessors, (718), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-10-11 02:32:23,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 915 transitions. [2024-10-11 02:32:23,116 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 915 transitions. Word has length 59 [2024-10-11 02:32:23,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:23,116 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 915 transitions. [2024-10-11 02:32:23,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:23,117 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 915 transitions. [2024-10-11 02:32:23,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 02:32:23,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:23,117 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:23,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:32:23,118 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:23,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:23,118 INFO L85 PathProgramCache]: Analyzing trace with hash 362239226, now seen corresponding path program 1 times [2024-10-11 02:32:23,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:23,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091838852] [2024-10-11 02:32:23,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:23,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:23,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:23,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:23,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:23,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:32:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:23,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:32:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:23,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:23,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:32:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:23,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:32:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:23,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:23,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091838852] [2024-10-11 02:32:23,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091838852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:23,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:23,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:32:23,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421940286] [2024-10-11 02:32:23,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:23,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:32:23,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:23,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:32:23,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:32:23,351 INFO L87 Difference]: Start difference. First operand 562 states and 915 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:26,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:26,079 INFO L93 Difference]: Finished difference Result 1191 states and 1960 transitions. [2024-10-11 02:32:26,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:32:26,080 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 60 [2024-10-11 02:32:26,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:26,083 INFO L225 Difference]: With dead ends: 1191 [2024-10-11 02:32:26,083 INFO L226 Difference]: Without dead ends: 699 [2024-10-11 02:32:26,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:32:26,085 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 679 mSDsluCounter, 2295 mSDsCounter, 0 mSdLazyCounter, 3415 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 2772 SdHoareTripleChecker+Invalid, 3524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 3415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:26,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 2772 Invalid, 3524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 3415 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 02:32:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-10-11 02:32:26,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 564. [2024-10-11 02:32:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 437 states have (on average 1.6453089244851258) internal successors, (719), 456 states have internal predecessors, (719), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-10-11 02:32:26,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 916 transitions. [2024-10-11 02:32:26,130 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 916 transitions. Word has length 60 [2024-10-11 02:32:26,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:26,130 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 916 transitions. [2024-10-11 02:32:26,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:26,130 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 916 transitions. [2024-10-11 02:32:26,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 02:32:26,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:26,131 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:26,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:32:26,131 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:26,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:26,132 INFO L85 PathProgramCache]: Analyzing trace with hash -962704422, now seen corresponding path program 1 times [2024-10-11 02:32:26,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:26,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004001550] [2024-10-11 02:32:26,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:26,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:26,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:26,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:26,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:26,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:32:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:26,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:32:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:26,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:26,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:32:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:26,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:32:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:26,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:26,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004001550] [2024-10-11 02:32:26,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004001550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:26,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:26,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:32:26,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648670678] [2024-10-11 02:32:26,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:26,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:26,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:26,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:26,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:32:26,310 INFO L87 Difference]: Start difference. First operand 564 states and 916 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:28,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:28,139 INFO L93 Difference]: Finished difference Result 1215 states and 1993 transitions. [2024-10-11 02:32:28,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:28,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2024-10-11 02:32:28,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:28,143 INFO L225 Difference]: With dead ends: 1215 [2024-10-11 02:32:28,144 INFO L226 Difference]: Without dead ends: 707 [2024-10-11 02:32:28,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:28,145 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 685 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 1817 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:28,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 1406 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1817 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 02:32:28,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-10-11 02:32:28,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 564. [2024-10-11 02:32:28,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 437 states have (on average 1.633867276887872) internal successors, (714), 456 states have internal predecessors, (714), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-10-11 02:32:28,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 911 transitions. [2024-10-11 02:32:28,191 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 911 transitions. Word has length 60 [2024-10-11 02:32:28,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:28,192 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 911 transitions. [2024-10-11 02:32:28,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:28,192 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 911 transitions. [2024-10-11 02:32:28,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 02:32:28,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:28,193 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:28,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:32:28,193 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:28,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:28,193 INFO L85 PathProgramCache]: Analyzing trace with hash 811041067, now seen corresponding path program 1 times [2024-10-11 02:32:28,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:28,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896472732] [2024-10-11 02:32:28,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:28,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:28,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:28,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:28,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:28,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:32:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:28,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 02:32:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:28,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:28,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:32:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:28,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:32:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:28,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:28,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:28,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896472732] [2024-10-11 02:32:28,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896472732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:28,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:28,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:32:28,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465031710] [2024-10-11 02:32:28,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:28,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:32:28,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:28,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:32:28,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:32:28,433 INFO L87 Difference]: Start difference. First operand 564 states and 911 transitions. Second operand has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:30,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:30,925 INFO L93 Difference]: Finished difference Result 1204 states and 1967 transitions. [2024-10-11 02:32:30,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:32:30,925 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 61 [2024-10-11 02:32:30,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:30,929 INFO L225 Difference]: With dead ends: 1204 [2024-10-11 02:32:30,929 INFO L226 Difference]: Without dead ends: 708 [2024-10-11 02:32:30,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:32:30,932 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 674 mSDsluCounter, 2276 mSDsCounter, 0 mSdLazyCounter, 3408 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 2749 SdHoareTripleChecker+Invalid, 3517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 3408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:30,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 2749 Invalid, 3517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 3408 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 02:32:30,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2024-10-11 02:32:30,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 570. [2024-10-11 02:32:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 443 states have (on average 1.6230248306997743) internal successors, (719), 462 states have internal predecessors, (719), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-10-11 02:32:30,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 916 transitions. [2024-10-11 02:32:30,978 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 916 transitions. Word has length 61 [2024-10-11 02:32:30,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:30,978 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 916 transitions. [2024-10-11 02:32:30,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:30,979 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 916 transitions. [2024-10-11 02:32:30,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 02:32:30,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:30,980 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:30,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:32:30,980 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:30,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:30,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1997509683, now seen corresponding path program 1 times [2024-10-11 02:32:30,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:30,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633417047] [2024-10-11 02:32:30,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:30,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:31,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:31,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:31,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:31,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:32:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:31,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 02:32:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:31,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:31,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:32:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:31,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:32:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:31,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:31,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:31,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633417047] [2024-10-11 02:32:31,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633417047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:31,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:31,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:32:31,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081193117] [2024-10-11 02:32:31,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:31,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:31,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:31,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:31,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:32:31,162 INFO L87 Difference]: Start difference. First operand 570 states and 916 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:32,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:32,913 INFO L93 Difference]: Finished difference Result 1230 states and 1998 transitions. [2024-10-11 02:32:32,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:32,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2024-10-11 02:32:32,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:32,930 INFO L225 Difference]: With dead ends: 1230 [2024-10-11 02:32:32,930 INFO L226 Difference]: Without dead ends: 716 [2024-10-11 02:32:32,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:32,932 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 683 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:32,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 1406 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 02:32:32,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2024-10-11 02:32:32,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 570. [2024-10-11 02:32:32,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 443 states have (on average 1.6117381489841986) internal successors, (714), 462 states have internal predecessors, (714), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-10-11 02:32:32,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 911 transitions. [2024-10-11 02:32:32,978 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 911 transitions. Word has length 61 [2024-10-11 02:32:32,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:32,978 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 911 transitions. [2024-10-11 02:32:32,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:32,978 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 911 transitions. [2024-10-11 02:32:32,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 02:32:32,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:32,979 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:32,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:32:32,979 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:32,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:32,979 INFO L85 PathProgramCache]: Analyzing trace with hash -807142241, now seen corresponding path program 1 times [2024-10-11 02:32:32,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:32,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976848890] [2024-10-11 02:32:32,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:32,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:32:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 02:32:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:32:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:32:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:33,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:33,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976848890] [2024-10-11 02:32:33,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976848890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:33,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:33,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:32:33,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401139644] [2024-10-11 02:32:33,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:33,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:32:33,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:33,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:32:33,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:32:33,195 INFO L87 Difference]: Start difference. First operand 570 states and 911 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:35,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:35,667 INFO L93 Difference]: Finished difference Result 1219 states and 1974 transitions. [2024-10-11 02:32:35,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:32:35,667 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2024-10-11 02:32:35,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:35,671 INFO L225 Difference]: With dead ends: 1219 [2024-10-11 02:32:35,671 INFO L226 Difference]: Without dead ends: 720 [2024-10-11 02:32:35,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:32:35,673 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 669 mSDsluCounter, 2264 mSDsCounter, 0 mSdLazyCounter, 3396 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 2734 SdHoareTripleChecker+Invalid, 3506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 3396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:35,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 2734 Invalid, 3506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 3396 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 02:32:35,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-10-11 02:32:35,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 578. [2024-10-11 02:32:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 451 states have (on average 1.598669623059867) internal successors, (721), 470 states have internal predecessors, (721), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-10-11 02:32:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 918 transitions. [2024-10-11 02:32:35,732 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 918 transitions. Word has length 62 [2024-10-11 02:32:35,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:35,732 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 918 transitions. [2024-10-11 02:32:35,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:35,733 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 918 transitions. [2024-10-11 02:32:35,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 02:32:35,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:35,734 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:35,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:32:35,734 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:35,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:35,735 INFO L85 PathProgramCache]: Analyzing trace with hash -35185025, now seen corresponding path program 1 times [2024-10-11 02:32:35,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:35,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604923045] [2024-10-11 02:32:35,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:35,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:35,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:35,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:35,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:35,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:32:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:35,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 02:32:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:35,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:35,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:32:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:35,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:32:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:35,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:35,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604923045] [2024-10-11 02:32:35,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604923045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:35,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:35,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:32:35,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212228381] [2024-10-11 02:32:35,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:35,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:35,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:35,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:35,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:32:35,901 INFO L87 Difference]: Start difference. First operand 578 states and 918 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:37,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:37,869 INFO L93 Difference]: Finished difference Result 1274 states and 2038 transitions. [2024-10-11 02:32:37,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:37,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 62 [2024-10-11 02:32:37,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:37,873 INFO L225 Difference]: With dead ends: 1274 [2024-10-11 02:32:37,873 INFO L226 Difference]: Without dead ends: 690 [2024-10-11 02:32:37,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:32:37,875 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 629 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:37,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1500 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 02:32:37,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-10-11 02:32:37,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 560. [2024-10-11 02:32:37,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 436 states have (on average 1.603211009174312) internal successors, (699), 453 states have internal predecessors, (699), 97 states have call successors, (97), 27 states have call predecessors, (97), 26 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 02:32:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 892 transitions. [2024-10-11 02:32:37,920 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 892 transitions. Word has length 62 [2024-10-11 02:32:37,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:37,920 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 892 transitions. [2024-10-11 02:32:37,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 892 transitions. [2024-10-11 02:32:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 02:32:37,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:37,921 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:37,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:32:37,921 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:37,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:37,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2077355728, now seen corresponding path program 1 times [2024-10-11 02:32:37,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:37,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751440023] [2024-10-11 02:32:37,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:37,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:38,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:38,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:38,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:38,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:32:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:38,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:38,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:38,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:32:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:38,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:32:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:38,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:38,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:38,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751440023] [2024-10-11 02:32:38,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751440023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:38,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:38,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:32:38,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323560384] [2024-10-11 02:32:38,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:38,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:32:38,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:38,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:32:38,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:32:38,154 INFO L87 Difference]: Start difference. First operand 560 states and 892 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:40,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:40,703 INFO L93 Difference]: Finished difference Result 1206 states and 1945 transitions. [2024-10-11 02:32:40,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:32:40,703 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2024-10-11 02:32:40,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:40,707 INFO L225 Difference]: With dead ends: 1206 [2024-10-11 02:32:40,707 INFO L226 Difference]: Without dead ends: 705 [2024-10-11 02:32:40,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:32:40,709 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 653 mSDsluCounter, 2216 mSDsCounter, 0 mSdLazyCounter, 3365 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 2676 SdHoareTripleChecker+Invalid, 3475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 3365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:40,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 2676 Invalid, 3475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 3365 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 02:32:40,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-11 02:32:40,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 570. [2024-10-11 02:32:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 446 states have (on average 1.5896860986547086) internal successors, (709), 463 states have internal predecessors, (709), 97 states have call successors, (97), 27 states have call predecessors, (97), 26 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 02:32:40,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 902 transitions. [2024-10-11 02:32:40,753 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 902 transitions. Word has length 63 [2024-10-11 02:32:40,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:40,754 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 902 transitions. [2024-10-11 02:32:40,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:40,754 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 902 transitions. [2024-10-11 02:32:40,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 02:32:40,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:40,755 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:40,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:32:40,755 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:40,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:40,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1258989996, now seen corresponding path program 1 times [2024-10-11 02:32:40,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:40,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169848424] [2024-10-11 02:32:40,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:40,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:40,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:40,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:40,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:40,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:40,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:32:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:40,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:40,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:32:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:40,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:32:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:40,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:40,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:40,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169848424] [2024-10-11 02:32:40,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169848424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:40,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:40,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 02:32:40,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228316807] [2024-10-11 02:32:40,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:40,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 02:32:40,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:40,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 02:32:40,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:32:40,977 INFO L87 Difference]: Start difference. First operand 570 states and 902 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:43,600 INFO L93 Difference]: Finished difference Result 1786 states and 2908 transitions. [2024-10-11 02:32:43,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:32:43,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 64 [2024-10-11 02:32:43,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:43,606 INFO L225 Difference]: With dead ends: 1786 [2024-10-11 02:32:43,606 INFO L226 Difference]: Without dead ends: 1286 [2024-10-11 02:32:43,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:32:43,608 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 1860 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1958 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:43,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1958 Valid, 979 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 02:32:43,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2024-10-11 02:32:43,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 996. [2024-10-11 02:32:43,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 780 states have (on average 1.6128205128205129) internal successors, (1258), 806 states have internal predecessors, (1258), 170 states have call successors, (170), 47 states have call predecessors, (170), 45 states have return successors, (175), 157 states have call predecessors, (175), 168 states have call successors, (175) [2024-10-11 02:32:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1603 transitions. [2024-10-11 02:32:43,703 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1603 transitions. Word has length 64 [2024-10-11 02:32:43,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:43,703 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1603 transitions. [2024-10-11 02:32:43,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:43,703 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1603 transitions. [2024-10-11 02:32:43,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 02:32:43,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:43,706 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:43,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 02:32:43,706 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:43,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:43,706 INFO L85 PathProgramCache]: Analyzing trace with hash -422815726, now seen corresponding path program 1 times [2024-10-11 02:32:43,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:43,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137561797] [2024-10-11 02:32:43,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:43,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:43,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:43,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:43,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:43,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:32:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:32:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:32:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:32:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,262 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 02:32:44,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:44,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137561797] [2024-10-11 02:32:44,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137561797] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:32:44,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462846151] [2024-10-11 02:32:44,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:44,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:44,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:32:44,265 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:32:44,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:32:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 1407 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:32:44,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:32:44,515 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 02:32:44,515 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:32:44,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462846151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:44,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:32:44,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 14 [2024-10-11 02:32:44,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412675979] [2024-10-11 02:32:44,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:44,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:32:44,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:44,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:32:44,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:32:44,516 INFO L87 Difference]: Start difference. First operand 996 states and 1603 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:32:44,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:44,765 INFO L93 Difference]: Finished difference Result 2836 states and 4681 transitions. [2024-10-11 02:32:44,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:32:44,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 115 [2024-10-11 02:32:44,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:44,778 INFO L225 Difference]: With dead ends: 2836 [2024-10-11 02:32:44,779 INFO L226 Difference]: Without dead ends: 1911 [2024-10-11 02:32:44,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:32:44,783 INFO L432 NwaCegarLoop]: 892 mSDtfsCounter, 849 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:44,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1667 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:32:44,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2024-10-11 02:32:44,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1899. [2024-10-11 02:32:44,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1899 states, 1484 states have (on average 1.6273584905660377) internal successors, (2415), 1533 states have internal predecessors, (2415), 327 states have call successors, (327), 89 states have call predecessors, (327), 87 states have return successors, (366), 306 states have call predecessors, (366), 323 states have call successors, (366) [2024-10-11 02:32:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1899 states and 3108 transitions. [2024-10-11 02:32:44,957 INFO L78 Accepts]: Start accepts. Automaton has 1899 states and 3108 transitions. Word has length 115 [2024-10-11 02:32:44,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:44,958 INFO L471 AbstractCegarLoop]: Abstraction has 1899 states and 3108 transitions. [2024-10-11 02:32:44,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:32:44,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 3108 transitions. [2024-10-11 02:32:44,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 02:32:44,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:44,962 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:44,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:32:45,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 02:32:45,167 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:45,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:45,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1515809687, now seen corresponding path program 1 times [2024-10-11 02:32:45,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:45,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190255418] [2024-10-11 02:32:45,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:45,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 02:32:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:32:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:32:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:32:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:32:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,752 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-11 02:32:45,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:45,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190255418] [2024-10-11 02:32:45,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190255418] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:32:45,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292581065] [2024-10-11 02:32:45,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:45,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:45,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:32:45,754 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:32:45,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:32:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 1408 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 02:32:45,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:32:46,100 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:46,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:32:46,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292581065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:46,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:32:46,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-10-11 02:32:46,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145868371] [2024-10-11 02:32:46,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:46,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:46,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:46,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:46,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:32:46,103 INFO L87 Difference]: Start difference. First operand 1899 states and 3108 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:32:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:46,746 INFO L93 Difference]: Finished difference Result 4776 states and 7858 transitions. [2024-10-11 02:32:46,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:46,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2024-10-11 02:32:46,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:46,759 INFO L225 Difference]: With dead ends: 4776 [2024-10-11 02:32:46,759 INFO L226 Difference]: Without dead ends: 2947 [2024-10-11 02:32:46,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:32:46,768 INFO L432 NwaCegarLoop]: 1108 mSDtfsCounter, 809 mSDsluCounter, 3516 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 4624 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:46,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 4624 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 02:32:46,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2024-10-11 02:32:47,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 2945. [2024-10-11 02:32:47,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2945 states, 2296 states have (on average 1.5945121951219512) internal successors, (3661), 2349 states have internal predecessors, (3661), 501 states have call successors, (501), 151 states have call predecessors, (501), 147 states have return successors, (632), 476 states have call predecessors, (632), 493 states have call successors, (632) [2024-10-11 02:32:47,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 4794 transitions. [2024-10-11 02:32:47,072 INFO L78 Accepts]: Start accepts. Automaton has 2945 states and 4794 transitions. Word has length 114 [2024-10-11 02:32:47,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:47,073 INFO L471 AbstractCegarLoop]: Abstraction has 2945 states and 4794 transitions. [2024-10-11 02:32:47,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:32:47,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2945 states and 4794 transitions. [2024-10-11 02:32:47,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 02:32:47,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:47,076 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:47,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 02:32:47,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:47,278 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:47,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:47,278 INFO L85 PathProgramCache]: Analyzing trace with hash 962676370, now seen corresponding path program 1 times [2024-10-11 02:32:47,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:47,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028455125] [2024-10-11 02:32:47,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:47,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:32:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:32:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:32:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:32:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,893 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 02:32:47,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:47,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028455125] [2024-10-11 02:32:47,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028455125] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:32:47,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474632652] [2024-10-11 02:32:47,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:47,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:47,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:32:47,896 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:32:47,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:32:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:48,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 1405 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 02:32:48,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:32:48,190 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:32:48,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:32:48,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474632652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:48,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:32:48,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 18 [2024-10-11 02:32:48,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037836061] [2024-10-11 02:32:48,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:48,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:48,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:48,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:48,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-10-11 02:32:48,191 INFO L87 Difference]: Start difference. First operand 2945 states and 4794 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:32:48,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:48,864 INFO L93 Difference]: Finished difference Result 5884 states and 9913 transitions. [2024-10-11 02:32:48,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:48,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 115 [2024-10-11 02:32:48,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:48,877 INFO L225 Difference]: With dead ends: 5884 [2024-10-11 02:32:48,877 INFO L226 Difference]: Without dead ends: 3009 [2024-10-11 02:32:48,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:32:48,891 INFO L432 NwaCegarLoop]: 815 mSDtfsCounter, 808 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 2067 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:48,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 2067 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 02:32:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2024-10-11 02:32:49,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 3009. [2024-10-11 02:32:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3009 states, 2352 states have (on average 1.5973639455782314) internal successors, (3757), 2405 states have internal predecessors, (3757), 501 states have call successors, (501), 159 states have call predecessors, (501), 155 states have return successors, (640), 476 states have call predecessors, (640), 493 states have call successors, (640) [2024-10-11 02:32:49,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3009 states to 3009 states and 4898 transitions. [2024-10-11 02:32:49,224 INFO L78 Accepts]: Start accepts. Automaton has 3009 states and 4898 transitions. Word has length 115 [2024-10-11 02:32:49,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:49,224 INFO L471 AbstractCegarLoop]: Abstraction has 3009 states and 4898 transitions. [2024-10-11 02:32:49,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:32:49,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3009 states and 4898 transitions. [2024-10-11 02:32:49,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 02:32:49,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:49,228 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:49,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 02:32:49,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:49,429 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:49,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:49,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1781759670, now seen corresponding path program 1 times [2024-10-11 02:32:49,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:49,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455876593] [2024-10-11 02:32:49,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:49,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:32:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:32:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:32:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:32:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:32:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:32:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:32:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-11 02:32:49,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:49,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455876593] [2024-10-11 02:32:49,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455876593] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:32:49,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658943537] [2024-10-11 02:32:49,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:49,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:49,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:32:49,850 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:32:49,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 02:32:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:50,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 1408 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 02:32:50,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:32:50,182 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 02:32:50,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:32:50,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658943537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:50,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:32:50,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-10-11 02:32:50,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128193492] [2024-10-11 02:32:50,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:50,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:50,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:50,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:50,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:32:50,184 INFO L87 Difference]: Start difference. First operand 3009 states and 4898 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:32:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:50,876 INFO L93 Difference]: Finished difference Result 6012 states and 10097 transitions. [2024-10-11 02:32:50,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:50,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 118 [2024-10-11 02:32:50,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:50,895 INFO L225 Difference]: With dead ends: 6012 [2024-10-11 02:32:50,895 INFO L226 Difference]: Without dead ends: 3073 [2024-10-11 02:32:50,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:32:50,911 INFO L432 NwaCegarLoop]: 812 mSDtfsCounter, 795 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:50,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 2064 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 02:32:50,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3073 states. [2024-10-11 02:32:51,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3073 to 3073. [2024-10-11 02:32:51,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3073 states, 2408 states have (on average 1.6000830564784052) internal successors, (3853), 2461 states have internal predecessors, (3853), 501 states have call successors, (501), 167 states have call predecessors, (501), 163 states have return successors, (648), 476 states have call predecessors, (648), 493 states have call successors, (648) [2024-10-11 02:32:51,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 5002 transitions. [2024-10-11 02:32:51,270 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 5002 transitions. Word has length 118 [2024-10-11 02:32:51,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:51,270 INFO L471 AbstractCegarLoop]: Abstraction has 3073 states and 5002 transitions. [2024-10-11 02:32:51,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:32:51,271 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 5002 transitions. [2024-10-11 02:32:51,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 02:32:51,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:51,273 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:51,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 02:32:51,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-11 02:32:51,478 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:51,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:51,479 INFO L85 PathProgramCache]: Analyzing trace with hash -950218226, now seen corresponding path program 1 times [2024-10-11 02:32:51,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:51,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046425638] [2024-10-11 02:32:51,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:51,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:32:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:32:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:32:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 02:32:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:32:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:32:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:32:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:32:51,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:51,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046425638] [2024-10-11 02:32:51,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046425638] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:32:51,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285164501] [2024-10-11 02:32:51,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:51,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:51,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:32:51,923 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:32:51,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 02:32:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:52,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 1411 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 02:32:52,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:32:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 02:32:52,195 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:32:52,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285164501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:52,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:32:52,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-10-11 02:32:52,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271652492] [2024-10-11 02:32:52,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:52,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:52,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:52,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:52,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:32:52,196 INFO L87 Difference]: Start difference. First operand 3073 states and 5002 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:32:52,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:52,819 INFO L93 Difference]: Finished difference Result 6140 states and 10281 transitions. [2024-10-11 02:32:52,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:52,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 121 [2024-10-11 02:32:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:52,839 INFO L225 Difference]: With dead ends: 6140 [2024-10-11 02:32:52,839 INFO L226 Difference]: Without dead ends: 3137 [2024-10-11 02:32:52,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:32:52,853 INFO L432 NwaCegarLoop]: 809 mSDtfsCounter, 799 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 2061 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:52,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 2061 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 02:32:52,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3137 states. [2024-10-11 02:32:53,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3137 to 3137. [2024-10-11 02:32:53,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3137 states, 2464 states have (on average 1.6026785714285714) internal successors, (3949), 2517 states have internal predecessors, (3949), 501 states have call successors, (501), 175 states have call predecessors, (501), 171 states have return successors, (656), 476 states have call predecessors, (656), 493 states have call successors, (656) [2024-10-11 02:32:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 5106 transitions. [2024-10-11 02:32:53,183 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 5106 transitions. Word has length 121 [2024-10-11 02:32:53,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:53,184 INFO L471 AbstractCegarLoop]: Abstraction has 3137 states and 5106 transitions. [2024-10-11 02:32:53,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:32:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 5106 transitions. [2024-10-11 02:32:53,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 02:32:53,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:53,187 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:53,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 02:32:53,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 02:32:53,391 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:53,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:53,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1699596842, now seen corresponding path program 1 times [2024-10-11 02:32:53,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:53,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205240807] [2024-10-11 02:32:53,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:53,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:53,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:53,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:53,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:53,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:53,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:53,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:53,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:53,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:32:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:53,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:32:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:53,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:53,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:53,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:32:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:53,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:32:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:53,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:32:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:53,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:53,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 02:32:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:53,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 02:32:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:53,841 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-11 02:32:53,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:53,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205240807] [2024-10-11 02:32:53,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205240807] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:32:53,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145181784] [2024-10-11 02:32:53,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:53,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:53,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:32:53,843 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:32:53,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 02:32:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:54,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 1414 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 02:32:54,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:32:54,113 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 02:32:54,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:32:54,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145181784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:54,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:32:54,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-10-11 02:32:54,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410496471] [2024-10-11 02:32:54,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:54,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:54,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:54,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:54,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:32:54,115 INFO L87 Difference]: Start difference. First operand 3137 states and 5106 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:32:54,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:54,869 INFO L93 Difference]: Finished difference Result 6268 states and 10465 transitions. [2024-10-11 02:32:54,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:54,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 124 [2024-10-11 02:32:54,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:54,888 INFO L225 Difference]: With dead ends: 6268 [2024-10-11 02:32:54,888 INFO L226 Difference]: Without dead ends: 3201 [2024-10-11 02:32:54,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:32:54,904 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 793 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 2058 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:54,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 2058 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 02:32:54,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2024-10-11 02:32:55,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 3201. [2024-10-11 02:32:55,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 2520 states have (on average 1.6051587301587302) internal successors, (4045), 2573 states have internal predecessors, (4045), 501 states have call successors, (501), 183 states have call predecessors, (501), 179 states have return successors, (664), 476 states have call predecessors, (664), 493 states have call successors, (664) [2024-10-11 02:32:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 5210 transitions. [2024-10-11 02:32:55,241 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 5210 transitions. Word has length 124 [2024-10-11 02:32:55,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:55,242 INFO L471 AbstractCegarLoop]: Abstraction has 3201 states and 5210 transitions. [2024-10-11 02:32:55,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:32:55,242 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 5210 transitions. [2024-10-11 02:32:55,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 02:32:55,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:55,245 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:55,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 02:32:55,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-11 02:32:55,446 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:55,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:55,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1062613110, now seen corresponding path program 1 times [2024-10-11 02:32:55,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:55,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722975411] [2024-10-11 02:32:55,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:55,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:55,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:55,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:55,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:55,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:55,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:55,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:32:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:32:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:32:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:32:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:32:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 02:32:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 02:32:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 02:32:56,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:56,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722975411] [2024-10-11 02:32:56,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722975411] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:32:56,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063378952] [2024-10-11 02:32:56,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:56,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:56,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:32:56,053 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:32:56,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 02:32:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 1417 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 02:32:56,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:32:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:32:56,360 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:32:56,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063378952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:56,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:32:56,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2024-10-11 02:32:56,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162166943] [2024-10-11 02:32:56,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:56,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:56,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:56,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:56,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-10-11 02:32:56,361 INFO L87 Difference]: Start difference. First operand 3201 states and 5210 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 6 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2024-10-11 02:32:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:57,782 INFO L93 Difference]: Finished difference Result 6560 states and 10719 transitions. [2024-10-11 02:32:57,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:57,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 6 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 127 [2024-10-11 02:32:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:57,798 INFO L225 Difference]: With dead ends: 6560 [2024-10-11 02:32:57,798 INFO L226 Difference]: Without dead ends: 3434 [2024-10-11 02:32:57,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:32:57,807 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 2015 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 1754 mSolverCounterSat, 511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2122 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 2265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 511 IncrementalHoareTripleChecker+Valid, 1754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:57,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2122 Valid, 777 Invalid, 2265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [511 Valid, 1754 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 02:32:57,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2024-10-11 02:32:58,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 3188. [2024-10-11 02:32:58,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3188 states, 2402 states have (on average 1.5682764363030808) internal successors, (3767), 2493 states have internal predecessors, (3767), 606 states have call successors, (606), 169 states have call predecessors, (606), 179 states have return successors, (746), 577 states have call predecessors, (746), 598 states have call successors, (746) [2024-10-11 02:32:58,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 5119 transitions. [2024-10-11 02:32:58,160 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 5119 transitions. Word has length 127 [2024-10-11 02:32:58,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:58,160 INFO L471 AbstractCegarLoop]: Abstraction has 3188 states and 5119 transitions. [2024-10-11 02:32:58,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 6 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2024-10-11 02:32:58,161 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 5119 transitions. [2024-10-11 02:32:58,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 02:32:58,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:58,163 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:58,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 02:32:58,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:58,365 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:58,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:58,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1741885364, now seen corresponding path program 1 times [2024-10-11 02:32:58,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:58,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487449443] [2024-10-11 02:32:58,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:58,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:58,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:32:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:32:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:32:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:32:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:32:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 02:32:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 02:32:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 02:32:58,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:58,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487449443] [2024-10-11 02:32:58,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487449443] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:32:58,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780115815] [2024-10-11 02:32:58,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:58,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:58,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:32:58,951 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:32:58,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 02:32:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 1420 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 02:32:59,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:32:59,255 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 02:32:59,256 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:32:59,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780115815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:59,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:32:59,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 19 [2024-10-11 02:32:59,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345475822] [2024-10-11 02:32:59,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:59,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:32:59,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:59,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:32:59,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:32:59,257 INFO L87 Difference]: Start difference. First operand 3188 states and 5119 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) [2024-10-11 02:33:02,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:33:02,546 INFO L93 Difference]: Finished difference Result 8396 states and 13809 transitions. [2024-10-11 02:33:02,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 02:33:02,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) Word has length 127 [2024-10-11 02:33:02,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:33:02,577 INFO L225 Difference]: With dead ends: 8396 [2024-10-11 02:33:02,578 INFO L226 Difference]: Without dead ends: 5280 [2024-10-11 02:33:02,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2024-10-11 02:33:02,592 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 2694 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 5921 mSolverCounterSat, 686 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2795 SdHoareTripleChecker+Valid, 1953 SdHoareTripleChecker+Invalid, 6607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 686 IncrementalHoareTripleChecker+Valid, 5921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:33:02,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2795 Valid, 1953 Invalid, 6607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [686 Valid, 5921 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 02:33:02,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5280 states. [2024-10-11 02:33:03,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5280 to 4900. [2024-10-11 02:33:03,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4900 states, 3645 states have (on average 1.570096021947874) internal successors, (5723), 3799 states have internal predecessors, (5723), 962 states have call successors, (962), 243 states have call predecessors, (962), 292 states have return successors, (1306), 934 states have call predecessors, (1306), 954 states have call successors, (1306) [2024-10-11 02:33:03,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4900 states to 4900 states and 7991 transitions. [2024-10-11 02:33:03,155 INFO L78 Accepts]: Start accepts. Automaton has 4900 states and 7991 transitions. Word has length 127 [2024-10-11 02:33:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:33:03,156 INFO L471 AbstractCegarLoop]: Abstraction has 4900 states and 7991 transitions. [2024-10-11 02:33:03,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) [2024-10-11 02:33:03,156 INFO L276 IsEmpty]: Start isEmpty. Operand 4900 states and 7991 transitions. [2024-10-11 02:33:03,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 02:33:03,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:33:03,159 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:33:03,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 02:33:03,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-11 02:33:03,360 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:33:03,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:33:03,360 INFO L85 PathProgramCache]: Analyzing trace with hash 344691701, now seen corresponding path program 1 times [2024-10-11 02:33:03,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:33:03,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055271086] [2024-10-11 02:33:03,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:33:03,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:33:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:33:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:33:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:33:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:33:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:33:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:33:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:33:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:33:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:33:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:33:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 02:33:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 02:33:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 02:33:03,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:33:03,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055271086] [2024-10-11 02:33:03,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055271086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:33:03,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:33:03,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:33:03,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827603428] [2024-10-11 02:33:03,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:33:03,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:33:03,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:33:03,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:33:03,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:33:03,926 INFO L87 Difference]: Start difference. First operand 4900 states and 7991 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16)