./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', 'c7f343ca08bbb19155b6fdcbbb14166f212aafb2275923d09d7fbaf9a31202b4'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 64bit --witnessprinter.graph.data.programhash c7f343ca08bbb19155b6fdcbbb14166f212aafb2275923d09d7fbaf9a31202b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 02:57:12,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 02:57:13,046 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 02:57:13,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 02:57:13,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 02:57:13,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 02:57:13,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 02:57:13,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 02:57:13,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 02:57:13,083 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 02:57:13,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 02:57:13,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 02:57:13,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 02:57:13,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 02:57:13,084 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 02:57:13,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 02:57:13,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 02:57:13,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 02:57:13,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 02:57:13,085 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 02:57:13,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 02:57:13,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 02:57:13,085 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 02:57:13,086 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 02:57:13,086 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 02:57:13,086 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 02:57:13,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 02:57:13,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 02:57:13,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 02:57:13,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:57:13,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 02:57:13,087 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 02:57:13,087 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 02:57:13,087 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 02:57:13,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 02:57:13,087 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 02:57:13,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 02:57:13,088 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 02:57:13,088 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 02:57:13,088 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7f343ca08bbb19155b6fdcbbb14166f212aafb2275923d09d7fbaf9a31202b4 [2024-11-07 02:57:13,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 02:57:13,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 02:57:13,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 02:57:13,385 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 02:57:13,385 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 02:57:13,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c [2024-11-07 02:57:14,591 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 02:57:14,840 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 02:57:14,841 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c [2024-11-07 02:57:14,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c72b184e6/fea240b1f12e4df0bd2becdffe077219/FLAGd3554e1e8 [2024-11-07 02:57:14,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c72b184e6/fea240b1f12e4df0bd2becdffe077219 [2024-11-07 02:57:14,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 02:57:14,874 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 02:57:14,875 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 02:57:14,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 02:57:14,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 02:57:14,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:57:14" (1/1) ... [2024-11-07 02:57:14,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55e5f1a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:14, skipping insertion in model container [2024-11-07 02:57:14,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:57:14" (1/1) ... [2024-11-07 02:57:14,907 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 02:57:15,017 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c[1249,1262] [2024-11-07 02:57:15,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:57:15,121 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 02:57:15,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c[1249,1262] [2024-11-07 02:57:15,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:57:15,213 INFO L204 MainTranslator]: Completed translation [2024-11-07 02:57:15,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:15 WrapperNode [2024-11-07 02:57:15,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 02:57:15,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 02:57:15,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 02:57:15,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 02:57:15,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:15" (1/1) ... [2024-11-07 02:57:15,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:15" (1/1) ... [2024-11-07 02:57:15,327 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 590 [2024-11-07 02:57:15,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 02:57:15,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 02:57:15,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 02:57:15,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 02:57:15,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:15" (1/1) ... [2024-11-07 02:57:15,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:15" (1/1) ... [2024-11-07 02:57:15,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:15" (1/1) ... [2024-11-07 02:57:15,386 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 02:57:15,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:15" (1/1) ... [2024-11-07 02:57:15,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:15" (1/1) ... [2024-11-07 02:57:15,409 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:15" (1/1) ... [2024-11-07 02:57:15,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:15" (1/1) ... [2024-11-07 02:57:15,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:15" (1/1) ... [2024-11-07 02:57:15,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:15" (1/1) ... [2024-11-07 02:57:15,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 02:57:15,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 02:57:15,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 02:57:15,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 02:57:15,451 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:15" (1/1) ... [2024-11-07 02:57:15,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:57:15,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 02:57:15,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 02:57:15,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 02:57:15,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 02:57:15,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 02:57:15,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 02:57:15,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 02:57:15,615 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 02:57:15,616 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 02:57:16,382 INFO L? ?]: Removed 347 outVars from TransFormulas that were not future-live. [2024-11-07 02:57:16,382 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 02:57:16,395 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 02:57:16,395 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 02:57:16,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:57:16 BoogieIcfgContainer [2024-11-07 02:57:16,396 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 02:57:16,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 02:57:16,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 02:57:16,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 02:57:16,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:57:14" (1/3) ... [2024-11-07 02:57:16,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f20bf86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:57:16, skipping insertion in model container [2024-11-07 02:57:16,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:15" (2/3) ... [2024-11-07 02:57:16,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f20bf86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:57:16, skipping insertion in model container [2024-11-07 02:57:16,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:57:16" (3/3) ... [2024-11-07 02:57:16,405 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Spinner.c [2024-11-07 02:57:16,418 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 02:57:16,419 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 02:57:16,473 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 02:57:16,485 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;@1107318b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 02:57:16,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 02:57:16,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 160 states have (on average 1.49375) internal successors, (239), 161 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:16,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-07 02:57:16,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:16,497 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:16,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:16,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:16,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1130863270, now seen corresponding path program 1 times [2024-11-07 02:57:16,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:16,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223830957] [2024-11-07 02:57:16,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:16,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:17,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:17,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:17,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223830957] [2024-11-07 02:57:17,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223830957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:17,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:17,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 02:57:17,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250076214] [2024-11-07 02:57:17,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:17,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 02:57:17,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:17,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 02:57:17,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:57:17,845 INFO L87 Difference]: Start difference. First operand has 162 states, 160 states have (on average 1.49375) internal successors, (239), 161 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:18,065 INFO L93 Difference]: Finished difference Result 352 states and 523 transitions. [2024-11-07 02:57:18,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 02:57:18,069 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-07 02:57:18,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:18,079 INFO L225 Difference]: With dead ends: 352 [2024-11-07 02:57:18,079 INFO L226 Difference]: Without dead ends: 204 [2024-11-07 02:57:18,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:57:18,084 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 47 mSDsluCounter, 1755 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1972 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:18,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1972 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:57:18,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-07 02:57:18,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 185. [2024-11-07 02:57:18,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.4891304347826086) internal successors, (274), 184 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:18,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 274 transitions. [2024-11-07 02:57:18,134 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 274 transitions. Word has length 35 [2024-11-07 02:57:18,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:18,135 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 274 transitions. [2024-11-07 02:57:18,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:18,135 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 274 transitions. [2024-11-07 02:57:18,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-07 02:57:18,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:18,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:18,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 02:57:18,136 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:18,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:18,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1698909476, now seen corresponding path program 1 times [2024-11-07 02:57:18,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:18,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432091987] [2024-11-07 02:57:18,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:18,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:18,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:18,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432091987] [2024-11-07 02:57:18,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432091987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:18,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:18,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:57:18,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646882923] [2024-11-07 02:57:18,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:18,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:57:18,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:18,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:57:18,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:57:18,421 INFO L87 Difference]: Start difference. First operand 185 states and 274 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:18,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:18,445 INFO L93 Difference]: Finished difference Result 189 states and 278 transitions. [2024-11-07 02:57:18,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:57:18,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-07 02:57:18,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:18,447 INFO L225 Difference]: With dead ends: 189 [2024-11-07 02:57:18,447 INFO L226 Difference]: Without dead ends: 187 [2024-11-07 02:57:18,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:57:18,448 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 0 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:18,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 693 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:57:18,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-07 02:57:18,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-11-07 02:57:18,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.4838709677419355) internal successors, (276), 186 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:18,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 276 transitions. [2024-11-07 02:57:18,464 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 276 transitions. Word has length 36 [2024-11-07 02:57:18,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:18,465 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 276 transitions. [2024-11-07 02:57:18,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:18,465 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 276 transitions. [2024-11-07 02:57:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-07 02:57:18,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:18,466 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:18,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 02:57:18,466 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:18,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:18,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1124890856, now seen corresponding path program 1 times [2024-11-07 02:57:18,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:18,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38231789] [2024-11-07 02:57:18,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:18,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:18,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:18,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38231789] [2024-11-07 02:57:18,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38231789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:18,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:18,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:57:18,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920143916] [2024-11-07 02:57:18,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:18,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:57:18,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:18,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:57:18,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:57:18,659 INFO L87 Difference]: Start difference. First operand 187 states and 276 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:18,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:18,694 INFO L93 Difference]: Finished difference Result 362 states and 535 transitions. [2024-11-07 02:57:18,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:57:18,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-07 02:57:18,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:18,697 INFO L225 Difference]: With dead ends: 362 [2024-11-07 02:57:18,697 INFO L226 Difference]: Without dead ends: 189 [2024-11-07 02:57:18,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:57:18,698 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:18,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 689 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:57:18,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-07 02:57:18,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2024-11-07 02:57:18,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.4787234042553192) internal successors, (278), 188 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:18,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 278 transitions. [2024-11-07 02:57:18,710 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 278 transitions. Word has length 37 [2024-11-07 02:57:18,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:18,711 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 278 transitions. [2024-11-07 02:57:18,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:18,711 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 278 transitions. [2024-11-07 02:57:18,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-07 02:57:18,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:18,712 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:18,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 02:57:18,712 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:18,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:18,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1609843915, now seen corresponding path program 1 times [2024-11-07 02:57:18,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:18,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160812780] [2024-11-07 02:57:18,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:18,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:19,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:19,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:19,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160812780] [2024-11-07 02:57:19,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160812780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:19,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:19,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 02:57:19,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960548971] [2024-11-07 02:57:19,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:19,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 02:57:19,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:19,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 02:57:19,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:57:19,442 INFO L87 Difference]: Start difference. First operand 189 states and 278 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:19,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:19,714 INFO L93 Difference]: Finished difference Result 386 states and 568 transitions. [2024-11-07 02:57:19,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 02:57:19,715 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-07 02:57:19,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:19,717 INFO L225 Difference]: With dead ends: 386 [2024-11-07 02:57:19,717 INFO L226 Difference]: Without dead ends: 211 [2024-11-07 02:57:19,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-07 02:57:19,721 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 30 mSDsluCounter, 2127 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2342 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:19,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2342 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:57:19,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-07 02:57:19,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2024-11-07 02:57:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.4734299516908214) internal successors, (305), 207 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 305 transitions. [2024-11-07 02:57:19,735 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 305 transitions. Word has length 38 [2024-11-07 02:57:19,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:19,735 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 305 transitions. [2024-11-07 02:57:19,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:19,735 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 305 transitions. [2024-11-07 02:57:19,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-07 02:57:19,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:19,736 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:19,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 02:57:19,737 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:19,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:19,737 INFO L85 PathProgramCache]: Analyzing trace with hash -63278127, now seen corresponding path program 1 times [2024-11-07 02:57:19,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:19,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691576300] [2024-11-07 02:57:19,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:19,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:20,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:20,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:20,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691576300] [2024-11-07 02:57:20,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691576300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:20,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:20,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 02:57:20,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811203467] [2024-11-07 02:57:20,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:20,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 02:57:20,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:20,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 02:57:20,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 02:57:20,090 INFO L87 Difference]: Start difference. First operand 208 states and 305 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:20,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:20,113 INFO L93 Difference]: Finished difference Result 357 states and 524 transitions. [2024-11-07 02:57:20,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 02:57:20,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-07 02:57:20,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:20,114 INFO L225 Difference]: With dead ends: 357 [2024-11-07 02:57:20,115 INFO L226 Difference]: Without dead ends: 163 [2024-11-07 02:57:20,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 02:57:20,117 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 2 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:20,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 457 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:57:20,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-07 02:57:20,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-11-07 02:57:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4691358024691359) internal successors, (238), 162 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2024-11-07 02:57:20,128 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 38 [2024-11-07 02:57:20,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:20,128 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2024-11-07 02:57:20,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:20,129 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2024-11-07 02:57:20,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-07 02:57:20,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:20,129 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:20,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 02:57:20,130 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:20,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:20,130 INFO L85 PathProgramCache]: Analyzing trace with hash -739979155, now seen corresponding path program 1 times [2024-11-07 02:57:20,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:20,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019974163] [2024-11-07 02:57:20,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:20,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:20,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:20,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:20,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019974163] [2024-11-07 02:57:20,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019974163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:20,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:20,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:57:20,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931701201] [2024-11-07 02:57:20,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:20,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:57:20,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:20,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:57:20,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:57:20,381 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:20,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:20,420 INFO L93 Difference]: Finished difference Result 316 states and 462 transitions. [2024-11-07 02:57:20,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:57:20,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-07 02:57:20,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:20,422 INFO L225 Difference]: With dead ends: 316 [2024-11-07 02:57:20,422 INFO L226 Difference]: Without dead ends: 167 [2024-11-07 02:57:20,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:57:20,423 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 210 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:20,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 683 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:57:20,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-07 02:57:20,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2024-11-07 02:57:20,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.4606060606060607) internal successors, (241), 165 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 241 transitions. [2024-11-07 02:57:20,436 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 241 transitions. Word has length 38 [2024-11-07 02:57:20,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:20,436 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 241 transitions. [2024-11-07 02:57:20,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:20,436 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 241 transitions. [2024-11-07 02:57:20,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 02:57:20,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:20,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:20,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 02:57:20,437 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:20,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:20,438 INFO L85 PathProgramCache]: Analyzing trace with hash 100027971, now seen corresponding path program 1 times [2024-11-07 02:57:20,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:20,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259586237] [2024-11-07 02:57:20,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:20,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:21,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:21,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:21,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259586237] [2024-11-07 02:57:21,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259586237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:21,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:21,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 02:57:21,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448953293] [2024-11-07 02:57:21,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:21,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 02:57:21,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:21,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 02:57:21,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:57:21,076 INFO L87 Difference]: Start difference. First operand 166 states and 241 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:21,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:21,267 INFO L93 Difference]: Finished difference Result 355 states and 517 transitions. [2024-11-07 02:57:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 02:57:21,267 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-07 02:57:21,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:21,268 INFO L225 Difference]: With dead ends: 355 [2024-11-07 02:57:21,268 INFO L226 Difference]: Without dead ends: 203 [2024-11-07 02:57:21,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:57:21,269 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 41 mSDsluCounter, 1908 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2120 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:21,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2120 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:57:21,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-07 02:57:21,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 184. [2024-11-07 02:57:21,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.453551912568306) internal successors, (266), 183 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 266 transitions. [2024-11-07 02:57:21,279 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 266 transitions. Word has length 39 [2024-11-07 02:57:21,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:21,280 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 266 transitions. [2024-11-07 02:57:21,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:21,281 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 266 transitions. [2024-11-07 02:57:21,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 02:57:21,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:21,284 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:21,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 02:57:21,285 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:21,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:21,285 INFO L85 PathProgramCache]: Analyzing trace with hash -555630329, now seen corresponding path program 1 times [2024-11-07 02:57:21,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:21,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116501500] [2024-11-07 02:57:21,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:21,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:21,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:21,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:21,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116501500] [2024-11-07 02:57:21,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116501500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:21,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:21,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 02:57:21,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592667359] [2024-11-07 02:57:21,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:21,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 02:57:21,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:21,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 02:57:21,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 02:57:21,661 INFO L87 Difference]: Start difference. First operand 184 states and 266 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:21,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:21,728 INFO L93 Difference]: Finished difference Result 370 states and 536 transitions. [2024-11-07 02:57:21,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 02:57:21,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-07 02:57:21,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:21,730 INFO L225 Difference]: With dead ends: 370 [2024-11-07 02:57:21,730 INFO L226 Difference]: Without dead ends: 200 [2024-11-07 02:57:21,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 02:57:21,731 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 12 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:21,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1109 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:21,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-07 02:57:21,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 194. [2024-11-07 02:57:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4455958549222798) internal successors, (279), 193 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:21,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 279 transitions. [2024-11-07 02:57:21,740 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 279 transitions. Word has length 39 [2024-11-07 02:57:21,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:21,740 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 279 transitions. [2024-11-07 02:57:21,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:21,741 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 279 transitions. [2024-11-07 02:57:21,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-07 02:57:21,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:21,742 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:21,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 02:57:21,743 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:21,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1069522374, now seen corresponding path program 1 times [2024-11-07 02:57:21,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:21,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004231916] [2024-11-07 02:57:21,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:21,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:22,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:22,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:22,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004231916] [2024-11-07 02:57:22,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004231916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:22,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:22,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 02:57:22,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546587106] [2024-11-07 02:57:22,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:22,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 02:57:22,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:22,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 02:57:22,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-07 02:57:22,359 INFO L87 Difference]: Start difference. First operand 194 states and 279 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:22,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:22,680 INFO L93 Difference]: Finished difference Result 395 states and 568 transitions. [2024-11-07 02:57:22,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 02:57:22,680 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-07 02:57:22,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:22,682 INFO L225 Difference]: With dead ends: 395 [2024-11-07 02:57:22,682 INFO L226 Difference]: Without dead ends: 215 [2024-11-07 02:57:22,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-07 02:57:22,683 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 54 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:22,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2522 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:57:22,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-07 02:57:22,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 197. [2024-11-07 02:57:22,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.4438775510204083) internal successors, (283), 196 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:22,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 283 transitions. [2024-11-07 02:57:22,689 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 283 transitions. Word has length 40 [2024-11-07 02:57:22,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:22,689 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 283 transitions. [2024-11-07 02:57:22,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:22,689 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 283 transitions. [2024-11-07 02:57:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-07 02:57:22,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:22,690 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:22,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 02:57:22,690 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:22,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:22,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2076193843, now seen corresponding path program 1 times [2024-11-07 02:57:22,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:22,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788025727] [2024-11-07 02:57:22,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:22,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:23,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:23,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:23,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788025727] [2024-11-07 02:57:23,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788025727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:23,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:23,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 02:57:23,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336672165] [2024-11-07 02:57:23,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:23,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 02:57:23,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:23,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 02:57:23,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2024-11-07 02:57:23,669 INFO L87 Difference]: Start difference. First operand 197 states and 283 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:24,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:24,069 INFO L93 Difference]: Finished difference Result 400 states and 575 transitions. [2024-11-07 02:57:24,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 02:57:24,070 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-07 02:57:24,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:24,072 INFO L225 Difference]: With dead ends: 400 [2024-11-07 02:57:24,073 INFO L226 Difference]: Without dead ends: 217 [2024-11-07 02:57:24,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-11-07 02:57:24,074 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 27 mSDsluCounter, 3079 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3304 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:24,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3304 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 02:57:24,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-07 02:57:24,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 211. [2024-11-07 02:57:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.4476190476190476) internal successors, (304), 210 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 304 transitions. [2024-11-07 02:57:24,086 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 304 transitions. Word has length 40 [2024-11-07 02:57:24,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:24,087 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 304 transitions. [2024-11-07 02:57:24,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:24,087 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 304 transitions. [2024-11-07 02:57:24,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-07 02:57:24,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:24,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:24,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 02:57:24,088 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:24,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:24,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1563115153, now seen corresponding path program 1 times [2024-11-07 02:57:24,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:24,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795925041] [2024-11-07 02:57:24,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:24,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:24,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:24,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:24,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795925041] [2024-11-07 02:57:24,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795925041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:24,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:24,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 02:57:24,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081910239] [2024-11-07 02:57:24,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:24,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:57:24,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:24,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:57:24,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:57:24,524 INFO L87 Difference]: Start difference. First operand 211 states and 304 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:24,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:24,606 INFO L93 Difference]: Finished difference Result 416 states and 601 transitions. [2024-11-07 02:57:24,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 02:57:24,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-07 02:57:24,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:24,608 INFO L225 Difference]: With dead ends: 416 [2024-11-07 02:57:24,608 INFO L226 Difference]: Without dead ends: 219 [2024-11-07 02:57:24,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:57:24,609 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 11 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:24,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1499 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:24,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-07 02:57:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 207. [2024-11-07 02:57:24,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.441747572815534) internal successors, (297), 206 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:24,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 297 transitions. [2024-11-07 02:57:24,614 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 297 transitions. Word has length 40 [2024-11-07 02:57:24,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:24,615 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 297 transitions. [2024-11-07 02:57:24,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:24,615 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 297 transitions. [2024-11-07 02:57:24,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-07 02:57:24,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:24,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:24,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 02:57:24,616 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:24,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:24,616 INFO L85 PathProgramCache]: Analyzing trace with hash -885198293, now seen corresponding path program 1 times [2024-11-07 02:57:24,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:24,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511043487] [2024-11-07 02:57:24,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:24,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:25,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:25,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:25,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511043487] [2024-11-07 02:57:25,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511043487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:25,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:25,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:57:25,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044867600] [2024-11-07 02:57:25,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:25,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:57:25,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:25,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:57:25,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:57:25,098 INFO L87 Difference]: Start difference. First operand 207 states and 297 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:25,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:25,162 INFO L93 Difference]: Finished difference Result 483 states and 688 transitions. [2024-11-07 02:57:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:57:25,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-07 02:57:25,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:25,165 INFO L225 Difference]: With dead ends: 483 [2024-11-07 02:57:25,165 INFO L226 Difference]: Without dead ends: 290 [2024-11-07 02:57:25,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:57:25,166 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 352 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:25,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 667 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:57:25,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-07 02:57:25,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 234. [2024-11-07 02:57:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.4291845493562232) internal successors, (333), 233 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 333 transitions. [2024-11-07 02:57:25,182 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 333 transitions. Word has length 41 [2024-11-07 02:57:25,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:25,182 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 333 transitions. [2024-11-07 02:57:25,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:25,182 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 333 transitions. [2024-11-07 02:57:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-07 02:57:25,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:25,182 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:25,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 02:57:25,183 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:25,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:25,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1968844420, now seen corresponding path program 1 times [2024-11-07 02:57:25,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:25,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971106578] [2024-11-07 02:57:25,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:25,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:25,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:25,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971106578] [2024-11-07 02:57:25,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971106578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:25,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:25,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 02:57:25,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97536989] [2024-11-07 02:57:25,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:25,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 02:57:25,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:25,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 02:57:25,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-07 02:57:25,810 INFO L87 Difference]: Start difference. First operand 234 states and 333 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:26,159 INFO L93 Difference]: Finished difference Result 543 states and 770 transitions. [2024-11-07 02:57:26,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 02:57:26,160 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-07 02:57:26,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:26,161 INFO L225 Difference]: With dead ends: 543 [2024-11-07 02:57:26,161 INFO L226 Difference]: Without dead ends: 350 [2024-11-07 02:57:26,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2024-11-07 02:57:26,163 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 376 mSDsluCounter, 2068 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 2275 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:26,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 2275 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:57:26,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-07 02:57:26,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 287. [2024-11-07 02:57:26,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.4265734265734267) internal successors, (408), 286 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 408 transitions. [2024-11-07 02:57:26,178 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 408 transitions. Word has length 41 [2024-11-07 02:57:26,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:26,178 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 408 transitions. [2024-11-07 02:57:26,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:26,178 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 408 transitions. [2024-11-07 02:57:26,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 02:57:26,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:26,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:26,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 02:57:26,180 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:26,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:26,180 INFO L85 PathProgramCache]: Analyzing trace with hash 659910420, now seen corresponding path program 1 times [2024-11-07 02:57:26,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:26,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013592682] [2024-11-07 02:57:26,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:26,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:26,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:26,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013592682] [2024-11-07 02:57:26,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013592682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:26,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:26,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 02:57:26,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442543615] [2024-11-07 02:57:26,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:26,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 02:57:26,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:26,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 02:57:26,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 02:57:26,504 INFO L87 Difference]: Start difference. First operand 287 states and 408 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:26,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:26,613 INFO L93 Difference]: Finished difference Result 577 states and 824 transitions. [2024-11-07 02:57:26,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 02:57:26,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-07 02:57:26,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:26,616 INFO L225 Difference]: With dead ends: 577 [2024-11-07 02:57:26,616 INFO L226 Difference]: Without dead ends: 371 [2024-11-07 02:57:26,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-07 02:57:26,617 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 419 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:26,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1091 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:26,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-07 02:57:26,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 306. [2024-11-07 02:57:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.419672131147541) internal successors, (433), 305 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 433 transitions. [2024-11-07 02:57:26,627 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 433 transitions. Word has length 42 [2024-11-07 02:57:26,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:26,628 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 433 transitions. [2024-11-07 02:57:26,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:26,629 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 433 transitions. [2024-11-07 02:57:26,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 02:57:26,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:26,629 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:26,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 02:57:26,630 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:26,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:26,630 INFO L85 PathProgramCache]: Analyzing trace with hash -14992208, now seen corresponding path program 1 times [2024-11-07 02:57:26,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:26,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246851534] [2024-11-07 02:57:26,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:26,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:27,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:27,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246851534] [2024-11-07 02:57:27,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246851534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:27,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:27,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 02:57:27,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757733142] [2024-11-07 02:57:27,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:27,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 02:57:27,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:27,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 02:57:27,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-07 02:57:27,402 INFO L87 Difference]: Start difference. First operand 306 states and 433 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:27,680 INFO L93 Difference]: Finished difference Result 564 states and 794 transitions. [2024-11-07 02:57:27,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 02:57:27,680 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-07 02:57:27,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:27,682 INFO L225 Difference]: With dead ends: 564 [2024-11-07 02:57:27,682 INFO L226 Difference]: Without dead ends: 371 [2024-11-07 02:57:27,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-07 02:57:27,685 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 45 mSDsluCounter, 1884 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:27,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2090 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:57:27,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-07 02:57:27,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 315. [2024-11-07 02:57:27,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.410828025477707) internal successors, (443), 314 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:27,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 443 transitions. [2024-11-07 02:57:27,695 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 443 transitions. Word has length 42 [2024-11-07 02:57:27,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:27,696 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 443 transitions. [2024-11-07 02:57:27,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:27,696 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 443 transitions. [2024-11-07 02:57:27,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-07 02:57:27,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:27,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:27,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 02:57:27,697 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:27,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:27,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2045751268, now seen corresponding path program 1 times [2024-11-07 02:57:27,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:27,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216318945] [2024-11-07 02:57:27,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:27,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:28,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:28,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216318945] [2024-11-07 02:57:28,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216318945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:28,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:28,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 02:57:28,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975303131] [2024-11-07 02:57:28,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:28,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 02:57:28,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:28,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 02:57:28,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 02:57:28,339 INFO L87 Difference]: Start difference. First operand 315 states and 443 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:28,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:28,556 INFO L93 Difference]: Finished difference Result 568 states and 798 transitions. [2024-11-07 02:57:28,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 02:57:28,557 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-07 02:57:28,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:28,558 INFO L225 Difference]: With dead ends: 568 [2024-11-07 02:57:28,558 INFO L226 Difference]: Without dead ends: 333 [2024-11-07 02:57:28,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-07 02:57:28,559 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 409 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:28,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1507 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:28,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-07 02:57:28,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 295. [2024-11-07 02:57:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 1.4149659863945578) internal successors, (416), 294 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 416 transitions. [2024-11-07 02:57:28,568 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 416 transitions. Word has length 43 [2024-11-07 02:57:28,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:28,568 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 416 transitions. [2024-11-07 02:57:28,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 416 transitions. [2024-11-07 02:57:28,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-07 02:57:28,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:28,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:28,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 02:57:28,569 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:28,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:28,570 INFO L85 PathProgramCache]: Analyzing trace with hash 266829603, now seen corresponding path program 1 times [2024-11-07 02:57:28,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:28,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032660787] [2024-11-07 02:57:28,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:28,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:28,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:28,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032660787] [2024-11-07 02:57:28,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032660787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:28,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:28,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:57:28,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673764046] [2024-11-07 02:57:28,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:28,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:57:28,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:28,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:57:28,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:57:28,984 INFO L87 Difference]: Start difference. First operand 295 states and 416 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:29,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:29,026 INFO L93 Difference]: Finished difference Result 535 states and 753 transitions. [2024-11-07 02:57:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:57:29,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-07 02:57:29,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:29,028 INFO L225 Difference]: With dead ends: 535 [2024-11-07 02:57:29,028 INFO L226 Difference]: Without dead ends: 307 [2024-11-07 02:57:29,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:57:29,029 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 223 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:29,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 669 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:57:29,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-07 02:57:29,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 301. [2024-11-07 02:57:29,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.4066666666666667) internal successors, (422), 300 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:29,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 422 transitions. [2024-11-07 02:57:29,038 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 422 transitions. Word has length 43 [2024-11-07 02:57:29,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:29,038 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 422 transitions. [2024-11-07 02:57:29,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:29,038 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 422 transitions. [2024-11-07 02:57:29,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 02:57:29,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:29,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:29,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 02:57:29,041 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:29,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:29,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1870091917, now seen corresponding path program 1 times [2024-11-07 02:57:29,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:29,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492183339] [2024-11-07 02:57:29,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:29,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:30,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:30,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492183339] [2024-11-07 02:57:30,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492183339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:30,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:30,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-07 02:57:30,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334218104] [2024-11-07 02:57:30,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:30,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 02:57:30,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:30,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 02:57:30,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2024-11-07 02:57:30,212 INFO L87 Difference]: Start difference. First operand 301 states and 422 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:30,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:30,906 INFO L93 Difference]: Finished difference Result 577 states and 810 transitions. [2024-11-07 02:57:30,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 02:57:30,907 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-07 02:57:30,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:30,909 INFO L225 Difference]: With dead ends: 577 [2024-11-07 02:57:30,909 INFO L226 Difference]: Without dead ends: 380 [2024-11-07 02:57:30,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2024-11-07 02:57:30,911 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 398 mSDsluCounter, 2980 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 3179 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:30,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 3179 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 02:57:30,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-07 02:57:30,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 313. [2024-11-07 02:57:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 1.4006410256410255) internal successors, (437), 312 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:30,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 437 transitions. [2024-11-07 02:57:30,919 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 437 transitions. Word has length 44 [2024-11-07 02:57:30,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:30,920 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 437 transitions. [2024-11-07 02:57:30,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:30,920 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 437 transitions. [2024-11-07 02:57:30,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 02:57:30,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:30,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:30,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 02:57:30,924 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:30,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:30,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1336705811, now seen corresponding path program 1 times [2024-11-07 02:57:30,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:30,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622996411] [2024-11-07 02:57:30,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:30,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:31,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:31,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622996411] [2024-11-07 02:57:31,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622996411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:31,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:31,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 02:57:31,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742318748] [2024-11-07 02:57:31,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:31,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:57:31,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:31,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:57:31,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:57:31,436 INFO L87 Difference]: Start difference. First operand 313 states and 437 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:31,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:31,514 INFO L93 Difference]: Finished difference Result 514 states and 725 transitions. [2024-11-07 02:57:31,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 02:57:31,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-07 02:57:31,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:31,516 INFO L225 Difference]: With dead ends: 514 [2024-11-07 02:57:31,516 INFO L226 Difference]: Without dead ends: 313 [2024-11-07 02:57:31,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:57:31,517 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 9 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:31,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1285 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:31,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-07 02:57:31,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 309. [2024-11-07 02:57:31,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.3928571428571428) internal successors, (429), 308 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 429 transitions. [2024-11-07 02:57:31,524 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 429 transitions. Word has length 44 [2024-11-07 02:57:31,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:31,525 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 429 transitions. [2024-11-07 02:57:31,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:31,525 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 429 transitions. [2024-11-07 02:57:31,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 02:57:31,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:31,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:31,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 02:57:31,526 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:31,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:31,526 INFO L85 PathProgramCache]: Analyzing trace with hash 776800112, now seen corresponding path program 1 times [2024-11-07 02:57:31,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:31,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860861925] [2024-11-07 02:57:31,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:31,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:31,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:31,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:31,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860861925] [2024-11-07 02:57:31,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860861925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:31,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:31,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 02:57:31,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017388892] [2024-11-07 02:57:31,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:31,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 02:57:31,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:31,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 02:57:31,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:57:31,685 INFO L87 Difference]: Start difference. First operand 309 states and 429 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:31,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:31,783 INFO L93 Difference]: Finished difference Result 591 states and 818 transitions. [2024-11-07 02:57:31,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:57:31,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-07 02:57:31,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:31,785 INFO L225 Difference]: With dead ends: 591 [2024-11-07 02:57:31,785 INFO L226 Difference]: Without dead ends: 312 [2024-11-07 02:57:31,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 02:57:31,786 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 72 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:31,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1054 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-07 02:57:31,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 283. [2024-11-07 02:57:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.3900709219858156) internal successors, (392), 282 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 392 transitions. [2024-11-07 02:57:31,794 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 392 transitions. Word has length 44 [2024-11-07 02:57:31,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:31,794 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 392 transitions. [2024-11-07 02:57:31,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 392 transitions. [2024-11-07 02:57:31,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-07 02:57:31,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:31,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:31,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 02:57:31,796 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:31,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:31,796 INFO L85 PathProgramCache]: Analyzing trace with hash 557281759, now seen corresponding path program 1 times [2024-11-07 02:57:31,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:31,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349039597] [2024-11-07 02:57:31,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:31,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:33,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:33,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:33,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349039597] [2024-11-07 02:57:33,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349039597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:33,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:33,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-07 02:57:33,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997642568] [2024-11-07 02:57:33,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:33,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 02:57:33,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:33,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 02:57:33,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-11-07 02:57:33,487 INFO L87 Difference]: Start difference. First operand 283 states and 392 transitions. Second operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:34,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:34,328 INFO L93 Difference]: Finished difference Result 563 states and 781 transitions. [2024-11-07 02:57:34,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 02:57:34,329 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-07 02:57:34,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:34,331 INFO L225 Difference]: With dead ends: 563 [2024-11-07 02:57:34,331 INFO L226 Difference]: Without dead ends: 367 [2024-11-07 02:57:34,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2024-11-07 02:57:34,333 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 240 mSDsluCounter, 3497 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 3694 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:34,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 3694 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 02:57:34,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-07 02:57:34,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 354. [2024-11-07 02:57:34,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.3796033994334278) internal successors, (487), 353 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:34,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 487 transitions. [2024-11-07 02:57:34,343 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 487 transitions. Word has length 45 [2024-11-07 02:57:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:34,344 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 487 transitions. [2024-11-07 02:57:34,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:34,344 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 487 transitions. [2024-11-07 02:57:34,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-07 02:57:34,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:34,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:34,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 02:57:34,347 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:34,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:34,347 INFO L85 PathProgramCache]: Analyzing trace with hash 136106392, now seen corresponding path program 1 times [2024-11-07 02:57:34,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:34,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908469512] [2024-11-07 02:57:34,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:34,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:34,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:34,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:34,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908469512] [2024-11-07 02:57:34,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908469512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:34,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:34,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 02:57:34,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378301692] [2024-11-07 02:57:34,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:34,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 02:57:34,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:34,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 02:57:34,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:57:34,616 INFO L87 Difference]: Start difference. First operand 354 states and 487 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:34,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:34,659 INFO L93 Difference]: Finished difference Result 583 states and 813 transitions. [2024-11-07 02:57:34,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 02:57:34,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-07 02:57:34,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:34,661 INFO L225 Difference]: With dead ends: 583 [2024-11-07 02:57:34,661 INFO L226 Difference]: Without dead ends: 357 [2024-11-07 02:57:34,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:57:34,664 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 1 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:34,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 896 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:57:34,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-07 02:57:34,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 341. [2024-11-07 02:57:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.3852941176470588) internal successors, (471), 340 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 471 transitions. [2024-11-07 02:57:34,671 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 471 transitions. Word has length 45 [2024-11-07 02:57:34,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:34,672 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 471 transitions. [2024-11-07 02:57:34,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:34,673 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 471 transitions. [2024-11-07 02:57:34,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-07 02:57:34,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:34,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:34,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 02:57:34,674 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:34,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:34,674 INFO L85 PathProgramCache]: Analyzing trace with hash -365601492, now seen corresponding path program 1 times [2024-11-07 02:57:34,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:34,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995185586] [2024-11-07 02:57:34,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:34,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:34,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:34,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:34,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995185586] [2024-11-07 02:57:34,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995185586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:34,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:34,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:57:34,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496573452] [2024-11-07 02:57:34,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:34,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:57:34,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:34,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:57:34,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:57:34,979 INFO L87 Difference]: Start difference. First operand 341 states and 471 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:34,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:34,994 INFO L93 Difference]: Finished difference Result 581 states and 811 transitions. [2024-11-07 02:57:34,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:57:34,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-07 02:57:34,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:34,996 INFO L225 Difference]: With dead ends: 581 [2024-11-07 02:57:34,996 INFO L226 Difference]: Without dead ends: 317 [2024-11-07 02:57:34,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:57:34,997 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 0 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:34,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 451 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:57:34,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-07 02:57:35,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2024-11-07 02:57:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 1.370253164556962) internal successors, (433), 316 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:35,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 433 transitions. [2024-11-07 02:57:35,005 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 433 transitions. Word has length 45 [2024-11-07 02:57:35,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:35,006 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 433 transitions. [2024-11-07 02:57:35,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:35,006 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 433 transitions. [2024-11-07 02:57:35,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-07 02:57:35,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:35,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:35,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 02:57:35,007 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:35,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:35,007 INFO L85 PathProgramCache]: Analyzing trace with hash 845346428, now seen corresponding path program 1 times [2024-11-07 02:57:35,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:35,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081083504] [2024-11-07 02:57:35,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:35,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:35,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:35,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:35,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081083504] [2024-11-07 02:57:35,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081083504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:35,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:35,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-07 02:57:35,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971114947] [2024-11-07 02:57:35,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:35,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 02:57:35,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:35,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 02:57:35,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-07 02:57:35,776 INFO L87 Difference]: Start difference. First operand 317 states and 433 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:36,019 INFO L93 Difference]: Finished difference Result 659 states and 911 transitions. [2024-11-07 02:57:36,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 02:57:36,019 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-07 02:57:36,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:36,021 INFO L225 Difference]: With dead ends: 659 [2024-11-07 02:57:36,021 INFO L226 Difference]: Without dead ends: 446 [2024-11-07 02:57:36,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-07 02:57:36,023 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 40 mSDsluCounter, 1992 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2242 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:36,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2242 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:57:36,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-07 02:57:36,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 366. [2024-11-07 02:57:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 1.367123287671233) internal successors, (499), 365 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 499 transitions. [2024-11-07 02:57:36,033 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 499 transitions. Word has length 45 [2024-11-07 02:57:36,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:36,033 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 499 transitions. [2024-11-07 02:57:36,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:36,033 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 499 transitions. [2024-11-07 02:57:36,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-07 02:57:36,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:36,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:36,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 02:57:36,035 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:36,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:36,035 INFO L85 PathProgramCache]: Analyzing trace with hash 189688128, now seen corresponding path program 1 times [2024-11-07 02:57:36,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:36,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54709873] [2024-11-07 02:57:36,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:36,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:36,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:36,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54709873] [2024-11-07 02:57:36,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54709873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:36,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:36,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:57:36,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239373728] [2024-11-07 02:57:36,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:36,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:57:36,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:36,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:57:36,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:57:36,584 INFO L87 Difference]: Start difference. First operand 366 states and 499 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:36,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:36,638 INFO L93 Difference]: Finished difference Result 656 states and 901 transitions. [2024-11-07 02:57:36,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:57:36,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-07 02:57:36,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:36,640 INFO L225 Difference]: With dead ends: 656 [2024-11-07 02:57:36,640 INFO L226 Difference]: Without dead ends: 361 [2024-11-07 02:57:36,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:57:36,642 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 341 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:36,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 661 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:57:36,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-07 02:57:36,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 332. [2024-11-07 02:57:36,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.3776435045317221) internal successors, (456), 331 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:36,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 456 transitions. [2024-11-07 02:57:36,656 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 456 transitions. Word has length 45 [2024-11-07 02:57:36,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:36,656 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 456 transitions. [2024-11-07 02:57:36,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:36,657 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 456 transitions. [2024-11-07 02:57:36,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-07 02:57:36,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:36,657 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:36,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 02:57:36,657 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:36,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:36,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1713953040, now seen corresponding path program 1 times [2024-11-07 02:57:36,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:36,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397228917] [2024-11-07 02:57:36,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:36,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:37,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:37,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397228917] [2024-11-07 02:57:37,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397228917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:37,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:37,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 02:57:37,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479834481] [2024-11-07 02:57:37,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:37,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 02:57:37,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:37,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 02:57:37,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-07 02:57:37,544 INFO L87 Difference]: Start difference. First operand 332 states and 456 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:37,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:37,827 INFO L93 Difference]: Finished difference Result 621 states and 856 transitions. [2024-11-07 02:57:37,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 02:57:37,828 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-07 02:57:37,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:37,829 INFO L225 Difference]: With dead ends: 621 [2024-11-07 02:57:37,829 INFO L226 Difference]: Without dead ends: 345 [2024-11-07 02:57:37,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-11-07 02:57:37,831 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 287 mSDsluCounter, 2113 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 2326 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:37,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 2326 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:57:37,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-07 02:57:37,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 316. [2024-11-07 02:57:37,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 1.384126984126984) internal successors, (436), 315 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:37,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 436 transitions. [2024-11-07 02:57:37,838 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 436 transitions. Word has length 46 [2024-11-07 02:57:37,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:37,838 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 436 transitions. [2024-11-07 02:57:37,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:37,838 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 436 transitions. [2024-11-07 02:57:37,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-07 02:57:37,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:37,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:37,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 02:57:37,839 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:37,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:37,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2053794780, now seen corresponding path program 1 times [2024-11-07 02:57:37,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:37,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564646538] [2024-11-07 02:57:37,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:37,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:38,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:38,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:38,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564646538] [2024-11-07 02:57:38,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564646538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:38,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:38,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 02:57:38,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401336740] [2024-11-07 02:57:38,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:38,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 02:57:38,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:38,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 02:57:38,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2024-11-07 02:57:38,464 INFO L87 Difference]: Start difference. First operand 316 states and 436 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:38,856 INFO L93 Difference]: Finished difference Result 593 states and 826 transitions. [2024-11-07 02:57:38,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 02:57:38,857 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-07 02:57:38,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:38,858 INFO L225 Difference]: With dead ends: 593 [2024-11-07 02:57:38,859 INFO L226 Difference]: Without dead ends: 343 [2024-11-07 02:57:38,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2024-11-07 02:57:38,860 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 22 mSDsluCounter, 2822 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3026 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:38,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3026 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 02:57:38,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-07 02:57:38,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 333. [2024-11-07 02:57:38,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.3825301204819278) internal successors, (459), 332 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 459 transitions. [2024-11-07 02:57:38,867 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 459 transitions. Word has length 46 [2024-11-07 02:57:38,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:38,867 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 459 transitions. [2024-11-07 02:57:38,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 459 transitions. [2024-11-07 02:57:38,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-07 02:57:38,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:38,867 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 02:57:38,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 02:57:38,867 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:38,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:38,868 INFO L85 PathProgramCache]: Analyzing trace with hash 442912650, now seen corresponding path program 1 times [2024-11-07 02:57:38,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:38,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200766249] [2024-11-07 02:57:38,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:38,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 02:57:38,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 02:57:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 02:57:38,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 02:57:38,998 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 02:57:38,998 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 02:57:39,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 02:57:39,003 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 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-11-07 02:57:39,060 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 02:57:39,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:57:39 BoogieIcfgContainer [2024-11-07 02:57:39,065 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 02:57:39,066 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 02:57:39,066 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 02:57:39,066 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 02:57:39,067 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:57:16" (3/4) ... [2024-11-07 02:57:39,069 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 02:57:39,070 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 02:57:39,071 INFO L158 Benchmark]: Toolchain (without parser) took 24196.90ms. Allocated memory was 117.4MB in the beginning and 629.1MB in the end (delta: 511.7MB). Free memory was 91.5MB in the beginning and 308.7MB in the end (delta: -217.2MB). Peak memory consumption was 294.2MB. Max. memory is 16.1GB. [2024-11-07 02:57:39,073 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:57:39,073 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.93ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 72.5MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 02:57:39,074 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.73ms. Allocated memory is still 117.4MB. Free memory was 72.5MB in the beginning and 61.5MB in the end (delta: 11.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 02:57:39,074 INFO L158 Benchmark]: Boogie Preprocessor took 119.96ms. Allocated memory is still 117.4MB. Free memory was 61.5MB in the beginning and 55.1MB in the end (delta: 6.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:57:39,074 INFO L158 Benchmark]: RCFGBuilder took 945.87ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 54.9MB in the beginning and 107.0MB in the end (delta: -52.1MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2024-11-07 02:57:39,074 INFO L158 Benchmark]: TraceAbstraction took 22666.31ms. Allocated memory was 151.0MB in the beginning and 629.1MB in the end (delta: 478.2MB). Free memory was 107.0MB in the beginning and 308.9MB in the end (delta: -201.9MB). Peak memory consumption was 274.0MB. Max. memory is 16.1GB. [2024-11-07 02:57:39,074 INFO L158 Benchmark]: Witness Printer took 3.81ms. Allocated memory is still 629.1MB. Free memory was 308.9MB in the beginning and 308.7MB in the end (delta: 165.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:57:39,075 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.93ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 72.5MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.73ms. Allocated memory is still 117.4MB. Free memory was 72.5MB in the beginning and 61.5MB in the end (delta: 11.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 119.96ms. Allocated memory is still 117.4MB. Free memory was 61.5MB in the beginning and 55.1MB in the end (delta: 6.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 945.87ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 54.9MB in the beginning and 107.0MB in the end (delta: -52.1MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. * TraceAbstraction took 22666.31ms. Allocated memory was 151.0MB in the beginning and 629.1MB in the end (delta: 478.2MB). Free memory was 107.0MB in the beginning and 308.9MB in the end (delta: -201.9MB). Peak memory consumption was 274.0MB. Max. memory is 16.1GB. * Witness Printer took 3.81ms. Allocated memory is still 629.1MB. Free memory was 308.9MB in the beginning and 308.7MB in the end (delta: 165.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 153, overapproximation of bitwiseAnd at line 161. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 5); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (5 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 32); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (32 - 1); [L35] const SORT_47 mask_SORT_47 = (SORT_47)-1 >> (sizeof(SORT_47) * 8 - 31); [L36] const SORT_47 msb_SORT_47 = (SORT_47)1 << (31 - 1); [L38] const SORT_57 mask_SORT_57 = (SORT_57)-1 >> (sizeof(SORT_57) * 8 - 30); [L39] const SORT_57 msb_SORT_57 = (SORT_57)1 << (30 - 1); [L41] const SORT_59 mask_SORT_59 = (SORT_59)-1 >> (sizeof(SORT_59) * 8 - 29); [L42] const SORT_59 msb_SORT_59 = (SORT_59)1 << (29 - 1); [L44] const SORT_65 mask_SORT_65 = (SORT_65)-1 >> (sizeof(SORT_65) * 8 - 2); [L45] const SORT_65 msb_SORT_65 = (SORT_65)1 << (2 - 1); [L47] const SORT_71 mask_SORT_71 = (SORT_71)-1 >> (sizeof(SORT_71) * 8 - 28); [L48] const SORT_71 msb_SORT_71 = (SORT_71)1 << (28 - 1); [L50] const SORT_73 mask_SORT_73 = (SORT_73)-1 >> (sizeof(SORT_73) * 8 - 26); [L51] const SORT_73 msb_SORT_73 = (SORT_73)1 << (26 - 1); [L53] const SORT_79 mask_SORT_79 = (SORT_79)-1 >> (sizeof(SORT_79) * 8 - 4); [L54] const SORT_79 msb_SORT_79 = (SORT_79)1 << (4 - 1); [L56] const SORT_85 mask_SORT_85 = (SORT_85)-1 >> (sizeof(SORT_85) * 8 - 24); [L57] const SORT_85 msb_SORT_85 = (SORT_85)1 << (24 - 1); [L59] const SORT_87 mask_SORT_87 = (SORT_87)-1 >> (sizeof(SORT_87) * 8 - 20); [L60] const SORT_87 msb_SORT_87 = (SORT_87)1 << (20 - 1); [L62] const SORT_93 mask_SORT_93 = (SORT_93)-1 >> (sizeof(SORT_93) * 8 - 8); [L63] const SORT_93 msb_SORT_93 = (SORT_93)1 << (8 - 1); [L65] const SORT_99 mask_SORT_99 = (SORT_99)-1 >> (sizeof(SORT_99) * 8 - 16); [L66] const SORT_99 msb_SORT_99 = (SORT_99)1 << (16 - 1); [L68] const SORT_5 var_8 = 0; [L69] const SORT_3 var_19 = 0; [L70] const SORT_3 var_40 = 1; [L72] SORT_1 input_2; [L73] SORT_3 input_4; [L74] SORT_5 input_6; [L75] SORT_3 input_7; [L77] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, var_19=0, var_40=1, var_8=0] [L77] SORT_5 state_9 = __VERIFIER_nondet_uint() & mask_SORT_5; [L78] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, var_19=0, var_40=1, var_8=0] [L78] SORT_5 state_13 = __VERIFIER_nondet_uint() & mask_SORT_5; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, var_19=0, var_40=1, var_8=0] [L79] SORT_3 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L81] SORT_5 init_10_arg_1 = var_8; [L82] state_9 = init_10_arg_1 [L83] SORT_5 init_14_arg_1 = var_8; [L84] state_13 = init_14_arg_1 [L85] SORT_3 init_21_arg_1 = var_19; [L86] state_20 = init_21_arg_1 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L89] input_2 = __VERIFIER_nondet_uchar() [L90] input_4 = __VERIFIER_nondet_uchar() [L91] input_6 = __VERIFIER_nondet_uint() [L92] input_7 = __VERIFIER_nondet_uchar() [L93] EXPR input_7 & mask_SORT_3 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L93] input_7 = input_7 & mask_SORT_3 [L96] SORT_5 var_11_arg_0 = state_9; [L97] SORT_5 var_11_arg_1 = var_8; [L98] SORT_3 var_11 = var_11_arg_0 == var_11_arg_1; [L99] SORT_3 var_12_arg_0 = var_11; [L100] SORT_3 var_12 = ~var_12_arg_0; [L101] SORT_5 var_15_arg_0 = state_13; [L102] SORT_5 var_15_arg_1 = var_8; [L103] SORT_3 var_15 = var_15_arg_0 == var_15_arg_1; [L104] SORT_3 var_16_arg_0 = var_15; [L105] SORT_3 var_16 = ~var_16_arg_0; [L106] SORT_3 var_17_arg_0 = var_12; [L107] SORT_3 var_17_arg_1 = var_16; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_17_arg_0=-2, var_17_arg_1=-2, var_40=1, var_8=0] [L108] EXPR var_17_arg_0 & var_17_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L108] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L109] SORT_3 var_18_arg_0 = var_17; [L110] SORT_3 var_18 = ~var_18_arg_0; [L111] SORT_3 var_22_arg_0 = state_20; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_18=-255, var_22_arg_0=0, var_40=1, var_8=0] [L112] EXPR var_22_arg_0 & mask_SORT_3 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_18=-255, var_40=1, var_8=0] [L112] var_22_arg_0 = var_22_arg_0 & mask_SORT_3 [L113] SORT_5 var_22 = var_22_arg_0; [L114] SORT_5 var_23_arg_0 = var_22; [L115] SORT_5 var_23_arg_1 = var_8; [L116] SORT_3 var_23 = var_23_arg_0 == var_23_arg_1; [L117] SORT_5 var_24_arg_0 = state_9; [L118] SORT_5 var_24_arg_1 = var_8; [L119] SORT_3 var_24 = var_24_arg_0 == var_24_arg_1; [L120] SORT_3 var_25_arg_0 = var_24; [L121] SORT_3 var_25 = ~var_25_arg_0; [L122] SORT_3 var_26_arg_0 = var_23; [L123] SORT_3 var_26_arg_1 = var_25; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_18=-255, var_26_arg_0=1, var_26_arg_1=-2, var_40=1, var_8=0] [L124] EXPR var_26_arg_0 | var_26_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_18=-255, var_40=1, var_8=0] [L124] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L125] SORT_3 var_27_arg_0 = var_18; [L126] SORT_3 var_27_arg_1 = var_26; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27_arg_0=-255, var_27_arg_1=255, var_40=1, var_8=0] [L127] EXPR var_27_arg_0 | var_27_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L127] SORT_3 var_27 = var_27_arg_0 | var_27_arg_1; [L128] SORT_5 var_28_arg_0 = state_9; [L129] SORT_5 var_28_arg_1 = var_8; [L130] SORT_3 var_28 = var_28_arg_0 == var_28_arg_1; [L131] SORT_5 var_29_arg_0 = state_13; [L132] SORT_5 var_29_arg_1 = var_8; [L133] SORT_3 var_29 = var_29_arg_0 == var_29_arg_1; [L134] SORT_3 var_30_arg_0 = var_28; [L135] SORT_3 var_30_arg_1 = var_29; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_30_arg_0=1, var_30_arg_1=1, var_40=1, var_8=0] [L136] EXPR var_30_arg_0 & var_30_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_40=1, var_8=0] [L136] SORT_3 var_30 = var_30_arg_0 & var_30_arg_1; [L137] SORT_3 var_31_arg_0 = var_30; [L138] SORT_3 var_31 = ~var_31_arg_0; [L139] SORT_3 var_32_arg_0 = state_20; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_31=-2, var_32_arg_0=0, var_40=1, var_8=0] [L140] EXPR var_32_arg_0 & mask_SORT_3 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_31=-2, var_40=1, var_8=0] [L140] var_32_arg_0 = var_32_arg_0 & mask_SORT_3 [L141] SORT_5 var_32 = var_32_arg_0; [L142] SORT_5 var_33_arg_0 = var_32; [L143] SORT_5 var_33_arg_1 = var_8; [L144] SORT_3 var_33 = var_33_arg_0 == var_33_arg_1; [L145] SORT_5 var_34_arg_0 = state_9; [L146] SORT_5 var_34_arg_1 = var_8; [L147] SORT_3 var_34 = var_34_arg_0 == var_34_arg_1; [L148] SORT_3 var_35_arg_0 = var_33; [L149] SORT_3 var_35_arg_1 = var_34; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_31=-2, var_35_arg_0=1, var_35_arg_1=1, var_40=1, var_8=0] [L150] EXPR var_35_arg_0 | var_35_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_31=-2, var_40=1, var_8=0] [L150] SORT_3 var_35 = var_35_arg_0 | var_35_arg_1; [L151] SORT_3 var_36_arg_0 = var_31; [L152] SORT_3 var_36_arg_1 = var_35; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_36_arg_0=-2, var_36_arg_1=1, var_40=1, var_8=0] [L153] EXPR var_36_arg_0 | var_36_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_40=1, var_8=0] [L153] SORT_3 var_36 = var_36_arg_0 | var_36_arg_1; [L154] SORT_3 var_37_arg_0 = var_27; [L155] SORT_3 var_37_arg_1 = var_36; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_37_arg_0=256, var_37_arg_1=254, var_40=1, var_8=0] [L156] EXPR var_37_arg_0 & var_37_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L156] SORT_3 var_37 = var_37_arg_0 & var_37_arg_1; [L157] SORT_3 var_41_arg_0 = var_37; [L158] SORT_3 var_41 = ~var_41_arg_0; [L159] SORT_3 var_42_arg_0 = var_40; [L160] SORT_3 var_42_arg_1 = var_41; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_42_arg_0=1, var_42_arg_1=-1, var_8=0] [L161] EXPR var_42_arg_0 & var_42_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L161] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L162] EXPR var_42 & mask_SORT_3 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L162] var_42 = var_42 & mask_SORT_3 [L163] SORT_3 bad_43_arg_0 = var_42; [L164] CALL __VERIFIER_assert(!(bad_43_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 162 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.6s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3668 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3668 mSDsluCounter, 44503 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38582 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5147 IncrementalHoareTripleChecker+Invalid, 5191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 5921 mSDtfsCounter, 5147 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=366occurred in iteration=24, InterpolantAutomatonStates: 263, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 645 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 1167 NumberOfCodeBlocks, 1167 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1094 ConstructedInterpolants, 0 QuantifiedInterpolants, 5960 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 02:57:39,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 64bit --witnessprinter.graph.data.programhash c7f343ca08bbb19155b6fdcbbb14166f212aafb2275923d09d7fbaf9a31202b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 02:57:41,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 02:57:41,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-07 02:57:41,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 02:57:41,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 02:57:41,615 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 02:57:41,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 02:57:41,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 02:57:41,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 02:57:41,616 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 02:57:41,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 02:57:41,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 02:57:41,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 02:57:41,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 02:57:41,617 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 02:57:41,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 02:57:41,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 02:57:41,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 02:57:41,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 02:57:41,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 02:57:41,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 02:57:41,620 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 02:57:41,620 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 02:57:41,620 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 02:57:41,620 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 02:57:41,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 02:57:41,620 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 02:57:41,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 02:57:41,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 02:57:41,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 02:57:41,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 02:57:41,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:57:41,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 02:57:41,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 02:57:41,621 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 02:57:41,621 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 02:57:41,621 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 02:57:41,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 02:57:41,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 02:57:41,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 02:57:41,622 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 02:57:41,622 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7f343ca08bbb19155b6fdcbbb14166f212aafb2275923d09d7fbaf9a31202b4 [2024-11-07 02:57:41,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 02:57:41,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 02:57:41,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 02:57:41,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 02:57:41,912 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 02:57:41,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c [2024-11-07 02:57:43,339 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 02:57:43,650 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 02:57:43,653 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c [2024-11-07 02:57:43,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ecca1ec49/42a51c4b60544b739d096abdf13995f9/FLAG5a5f65ec8 [2024-11-07 02:57:43,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ecca1ec49/42a51c4b60544b739d096abdf13995f9 [2024-11-07 02:57:43,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 02:57:43,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 02:57:43,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 02:57:43,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 02:57:43,944 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 02:57:43,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:57:43" (1/1) ... [2024-11-07 02:57:43,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29ce7de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:43, skipping insertion in model container [2024-11-07 02:57:43,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:57:43" (1/1) ... [2024-11-07 02:57:43,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 02:57:44,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c[1249,1262] [2024-11-07 02:57:44,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:57:44,258 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 02:57:44,272 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c[1249,1262] [2024-11-07 02:57:44,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:57:44,345 INFO L204 MainTranslator]: Completed translation [2024-11-07 02:57:44,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:44 WrapperNode [2024-11-07 02:57:44,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 02:57:44,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 02:57:44,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 02:57:44,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 02:57:44,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:44" (1/1) ... [2024-11-07 02:57:44,368 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:44" (1/1) ... [2024-11-07 02:57:44,403 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 286 [2024-11-07 02:57:44,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 02:57:44,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 02:57:44,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 02:57:44,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 02:57:44,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:44" (1/1) ... [2024-11-07 02:57:44,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:44" (1/1) ... [2024-11-07 02:57:44,432 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:44" (1/1) ... [2024-11-07 02:57:44,455 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 02:57:44,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:44" (1/1) ... [2024-11-07 02:57:44,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:44" (1/1) ... [2024-11-07 02:57:44,476 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:44" (1/1) ... [2024-11-07 02:57:44,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:44" (1/1) ... [2024-11-07 02:57:44,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:44" (1/1) ... [2024-11-07 02:57:44,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:44" (1/1) ... [2024-11-07 02:57:44,487 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 02:57:44,492 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 02:57:44,492 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 02:57:44,492 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 02:57:44,494 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:44" (1/1) ... [2024-11-07 02:57:44,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:57:44,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 02:57:44,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 02:57:44,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 02:57:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 02:57:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 02:57:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 02:57:44,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 02:57:44,719 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 02:57:44,721 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 02:57:45,084 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-07 02:57:45,084 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 02:57:45,094 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 02:57:45,094 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 02:57:45,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:57:45 BoogieIcfgContainer [2024-11-07 02:57:45,095 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 02:57:45,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 02:57:45,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 02:57:45,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 02:57:45,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:57:43" (1/3) ... [2024-11-07 02:57:45,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63513e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:57:45, skipping insertion in model container [2024-11-07 02:57:45,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:44" (2/3) ... [2024-11-07 02:57:45,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63513e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:57:45, skipping insertion in model container [2024-11-07 02:57:45,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:57:45" (3/3) ... [2024-11-07 02:57:45,106 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Spinner.c [2024-11-07 02:57:45,121 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 02:57:45,122 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 02:57:45,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 02:57:45,177 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;@16437a3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 02:57:45,178 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 02:57:45,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:45,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 02:57:45,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:45,190 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 02:57:45,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:45,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:45,195 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-07 02:57:45,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 02:57:45,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064453041] [2024-11-07 02:57:45,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:45,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:57:45,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 02:57:45,208 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 02:57:45,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 02:57:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:45,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-07 02:57:45,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:57:45,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:45,733 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 02:57:45,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 02:57:45,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064453041] [2024-11-07 02:57:45,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064453041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:45,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:45,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:57:45,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742534303] [2024-11-07 02:57:45,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:45,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:57:45,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 02:57:45,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:57:45,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:57:45,764 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:45,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:45,853 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2024-11-07 02:57:45,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:57:45,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-07 02:57:45,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:45,862 INFO L225 Difference]: With dead ends: 16 [2024-11-07 02:57:45,862 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 02:57:45,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:57:45,870 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:45,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:45,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 02:57:45,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 02:57:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:45,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 02:57:45,892 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2024-11-07 02:57:45,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:45,892 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 02:57:45,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:45,893 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 02:57:45,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 02:57:45,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 02:57:45,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 02:57:46,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:57:46,099 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-07 02:57:46,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 02:57:46,108 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 02:57:46,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:57:46 BoogieIcfgContainer [2024-11-07 02:57:46,117 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 02:57:46,118 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 02:57:46,118 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 02:57:46,118 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 02:57:46,119 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:57:45" (3/4) ... [2024-11-07 02:57:46,121 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 02:57:46,128 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-07 02:57:46,129 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 02:57:46,130 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 02:57:46,130 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 02:57:46,214 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 02:57:46,214 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 02:57:46,214 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 02:57:46,215 INFO L158 Benchmark]: Toolchain (without parser) took 2279.65ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 40.8MB in the end (delta: 50.9MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. [2024-11-07 02:57:46,216 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:57:46,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.84ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 73.0MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 02:57:46,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.93ms. Allocated memory is still 117.4MB. Free memory was 73.0MB in the beginning and 70.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:57:46,217 INFO L158 Benchmark]: Boogie Preprocessor took 87.07ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 67.4MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 02:57:46,218 INFO L158 Benchmark]: RCFGBuilder took 603.37ms. Allocated memory is still 117.4MB. Free memory was 67.4MB in the beginning and 74.7MB in the end (delta: -7.3MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-11-07 02:57:46,218 INFO L158 Benchmark]: TraceAbstraction took 1019.66ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 47.0MB in the end (delta: 27.2MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2024-11-07 02:57:46,219 INFO L158 Benchmark]: Witness Printer took 96.50ms. Allocated memory is still 117.4MB. Free memory was 47.0MB in the beginning and 40.8MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 02:57:46,220 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.84ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 73.0MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.93ms. Allocated memory is still 117.4MB. Free memory was 73.0MB in the beginning and 70.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 87.07ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 67.4MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 603.37ms. Allocated memory is still 117.4MB. Free memory was 67.4MB in the beginning and 74.7MB in the end (delta: -7.3MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1019.66ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 47.0MB in the end (delta: 27.2MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * Witness Printer took 96.50ms. Allocated memory is still 117.4MB. Free memory was 47.0MB in the beginning and 40.8MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 2 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 18 SizeOfPredicates, 4 NumberOfNonLiveVariables, 119 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-11-07 02:57:46,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE