./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p17.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.vcegar_QF_BV_itc99_b13_p17.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', '53546c4dcb2cff2eaca8f311738b2b6b829a702db585862ee7ca5a0b611bb252'] 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.vcegar_QF_BV_itc99_b13_p17.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 53546c4dcb2cff2eaca8f311738b2b6b829a702db585862ee7ca5a0b611bb252 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:46:45,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:46:46,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 03:46:46,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:46:46,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:46:46,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:46:46,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:46:46,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:46:46,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:46:46,093 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:46:46,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:46:46,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:46:46,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:46:46,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:46:46,094 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:46:46,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:46:46,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:46:46,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 03:46:46,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:46:46,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:46:46,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:46:46,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:46:46,095 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:46:46,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:46:46,095 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:46:46,095 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:46:46,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:46:46,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:46:46,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:46:46,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:46:46,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:46:46,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:46:46,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:46:46,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 03:46:46,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 03:46:46,097 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:46:46,097 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:46:46,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:46:46,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:46:46,097 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 -> 53546c4dcb2cff2eaca8f311738b2b6b829a702db585862ee7ca5a0b611bb252 [2024-11-07 03:46:46,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:46:46,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:46:46,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:46:46,414 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:46:46,414 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:46:46,415 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.vcegar_QF_BV_itc99_b13_p17.c [2024-11-07 03:46:47,729 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:46:48,017 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:46:48,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p17.c [2024-11-07 03:46:48,029 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/083e49830/88e186702c434df4ac001b3ab9164cf7/FLAG55d0a0054 [2024-11-07 03:46:48,052 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/083e49830/88e186702c434df4ac001b3ab9164cf7 [2024-11-07 03:46:48,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:46:48,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:46:48,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:46:48,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:46:48,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:46:48,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:46:48" (1/1) ... [2024-11-07 03:46:48,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aa9b89f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:48, skipping insertion in model container [2024-11-07 03:46:48,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:46:48" (1/1) ... [2024-11-07 03:46:48,087 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:46:48,241 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.vcegar_QF_BV_itc99_b13_p17.c[1266,1279] [2024-11-07 03:46:48,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:46:48,311 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:46:48,321 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.vcegar_QF_BV_itc99_b13_p17.c[1266,1279] [2024-11-07 03:46:48,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:46:48,381 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:46:48,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:48 WrapperNode [2024-11-07 03:46:48,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:46:48,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:46:48,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:46:48,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:46:48,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:48" (1/1) ... [2024-11-07 03:46:48,403 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:48" (1/1) ... [2024-11-07 03:46:48,447 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 263 [2024-11-07 03:46:48,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:46:48,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:46:48,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:46:48,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:46:48,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:48" (1/1) ... [2024-11-07 03:46:48,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:48" (1/1) ... [2024-11-07 03:46:48,464 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:48" (1/1) ... [2024-11-07 03:46:48,487 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 03:46:48,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:48" (1/1) ... [2024-11-07 03:46:48,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:48" (1/1) ... [2024-11-07 03:46:48,497 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:48" (1/1) ... [2024-11-07 03:46:48,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:48" (1/1) ... [2024-11-07 03:46:48,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:48" (1/1) ... [2024-11-07 03:46:48,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:48" (1/1) ... [2024-11-07 03:46:48,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:46:48,509 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:46:48,509 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:46:48,509 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:46:48,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:48" (1/1) ... [2024-11-07 03:46:48,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:46:48,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:46:48,549 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 03:46:48,556 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 03:46:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:46:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 03:46:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:46:48,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:46:48,681 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:46:48,683 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:46:49,095 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-07 03:46:49,095 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:46:49,106 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:46:49,106 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:46:49,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:46:49 BoogieIcfgContainer [2024-11-07 03:46:49,107 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:46:49,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:46:49,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:46:49,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:46:49,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:46:48" (1/3) ... [2024-11-07 03:46:49,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74412515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:46:49, skipping insertion in model container [2024-11-07 03:46:49,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:48" (2/3) ... [2024-11-07 03:46:49,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74412515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:46:49, skipping insertion in model container [2024-11-07 03:46:49,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:46:49" (3/3) ... [2024-11-07 03:46:49,118 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p17.c [2024-11-07 03:46:49,132 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:46:49,133 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:46:49,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:46:49,199 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;@69b1b762, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:46:49,200 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:46:49,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 45 states have internal predecessors, (65), 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 03:46:49,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 03:46:49,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:46:49,213 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] [2024-11-07 03:46:49,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:46:49,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:46:49,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1343812480, now seen corresponding path program 1 times [2024-11-07 03:46:49,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:46:49,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452879464] [2024-11-07 03:46:49,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:46:49,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:46:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:46:49,808 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 03:46:49,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:46:49,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452879464] [2024-11-07 03:46:49,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452879464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:46:49,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:46:49,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:46:49,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675411986] [2024-11-07 03:46:49,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:46:49,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:46:49,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:46:49,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:46:49,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:46:49,840 INFO L87 Difference]: Start difference. First operand has 46 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 45 states have internal predecessors, (65), 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 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 03:46:49,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:46:49,884 INFO L93 Difference]: Finished difference Result 77 states and 111 transitions. [2024-11-07 03:46:49,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:46:49,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2024-11-07 03:46:49,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:46:49,896 INFO L225 Difference]: With dead ends: 77 [2024-11-07 03:46:49,896 INFO L226 Difference]: Without dead ends: 45 [2024-11-07 03:46:49,899 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 03:46:49,902 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 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 03:46:49,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:46:49,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-07 03:46:49,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-07 03:46:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 44 states have internal predecessors, (63), 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 03:46:49,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2024-11-07 03:46:49,942 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 21 [2024-11-07 03:46:49,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:46:49,943 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2024-11-07 03:46:49,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 03:46:49,944 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2024-11-07 03:46:49,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 03:46:49,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:46:49,945 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] [2024-11-07 03:46:49,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 03:46:49,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:46:49,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:46:49,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1293181337, now seen corresponding path program 1 times [2024-11-07 03:46:49,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:46:49,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234570709] [2024-11-07 03:46:49,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:46:49,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:46:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:46:50,128 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 03:46:50,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:46:50,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234570709] [2024-11-07 03:46:50,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234570709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:46:50,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:46:50,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:46:50,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793165858] [2024-11-07 03:46:50,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:46:50,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:46:50,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:46:50,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:46:50,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:46:50,132 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 03:46:50,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:46:50,168 INFO L93 Difference]: Finished difference Result 78 states and 109 transitions. [2024-11-07 03:46:50,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:46:50,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-11-07 03:46:50,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:46:50,170 INFO L225 Difference]: With dead ends: 78 [2024-11-07 03:46:50,170 INFO L226 Difference]: Without dead ends: 47 [2024-11-07 03:46:50,170 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 03:46:50,171 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 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 03:46:50,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:46:50,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-07 03:46:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-07 03:46:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 46 states have internal predecessors, (65), 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 03:46:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2024-11-07 03:46:50,178 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 22 [2024-11-07 03:46:50,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:46:50,179 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2024-11-07 03:46:50,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 03:46:50,179 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2024-11-07 03:46:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 03:46:50,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:46:50,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] [2024-11-07 03:46:50,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 03:46:50,183 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:46:50,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:46:50,185 INFO L85 PathProgramCache]: Analyzing trace with hash 335949945, now seen corresponding path program 1 times [2024-11-07 03:46:50,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:46:50,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292697428] [2024-11-07 03:46:50,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:46:50,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:46:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:46:50,537 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 03:46:50,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:46:50,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292697428] [2024-11-07 03:46:50,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292697428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:46:50,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:46:50,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:46:50,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622368771] [2024-11-07 03:46:50,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:46:50,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:46:50,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:46:50,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:46:50,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:46:50,539 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 03:46:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:46:50,580 INFO L93 Difference]: Finished difference Result 80 states and 110 transitions. [2024-11-07 03:46:50,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:46:50,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2024-11-07 03:46:50,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:46:50,583 INFO L225 Difference]: With dead ends: 80 [2024-11-07 03:46:50,584 INFO L226 Difference]: Without dead ends: 47 [2024-11-07 03:46:50,584 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 03:46:50,585 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:46:50,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 155 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:46:50,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-07 03:46:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-07 03:46:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.391304347826087) internal successors, (64), 46 states have internal predecessors, (64), 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 03:46:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2024-11-07 03:46:50,591 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 23 [2024-11-07 03:46:50,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:46:50,591 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2024-11-07 03:46:50,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 03:46:50,591 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2024-11-07 03:46:50,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 03:46:50,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:46:50,592 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] [2024-11-07 03:46:50,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 03:46:50,592 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:46:50,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:46:50,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1561566688, now seen corresponding path program 1 times [2024-11-07 03:46:50,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:46:50,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146278549] [2024-11-07 03:46:50,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:46:50,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:46:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:46:50,961 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 03:46:50,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:46:50,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146278549] [2024-11-07 03:46:50,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146278549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:46:50,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:46:50,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:46:50,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138193162] [2024-11-07 03:46:50,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:46:50,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:46:50,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:46:50,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:46:50,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:46:50,966 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 03:46:51,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:46:51,019 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2024-11-07 03:46:51,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:46:51,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2024-11-07 03:46:51,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:46:51,021 INFO L225 Difference]: With dead ends: 84 [2024-11-07 03:46:51,021 INFO L226 Difference]: Without dead ends: 51 [2024-11-07 03:46:51,021 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 03:46:51,022 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 53 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:46:51,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 159 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:46:51,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-07 03:46:51,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-11-07 03:46:51,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 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 03:46:51,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2024-11-07 03:46:51,026 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 24 [2024-11-07 03:46:51,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:46:51,026 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2024-11-07 03:46:51,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 03:46:51,027 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2024-11-07 03:46:51,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 03:46:51,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:46:51,027 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] [2024-11-07 03:46:51,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 03:46:51,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:46:51,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:46:51,030 INFO L85 PathProgramCache]: Analyzing trace with hash -844580682, now seen corresponding path program 1 times [2024-11-07 03:46:51,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:46:51,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106092741] [2024-11-07 03:46:51,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:46:51,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:46:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:46:51,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 03:46:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:46:51,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 03:46:51,155 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 03:46:51,157 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 03:46:51,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 03:46:51,162 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-07 03:46:51,195 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 03:46:51,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:46:51 BoogieIcfgContainer [2024-11-07 03:46:51,201 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 03:46:51,201 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 03:46:51,201 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 03:46:51,202 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 03:46:51,202 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:46:49" (3/4) ... [2024-11-07 03:46:51,205 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 03:46:51,206 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 03:46:51,207 INFO L158 Benchmark]: Toolchain (without parser) took 3149.57ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 36.8MB in the end (delta: 39.8MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2024-11-07 03:46:51,207 INFO L158 Benchmark]: CDTParser took 0.78ms. Allocated memory is still 83.9MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:46:51,210 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.97ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 63.2MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 03:46:51,210 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.38ms. Allocated memory is still 100.7MB. Free memory was 63.2MB in the beginning and 58.9MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:46:51,211 INFO L158 Benchmark]: Boogie Preprocessor took 60.00ms. Allocated memory is still 100.7MB. Free memory was 58.9MB in the beginning and 56.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:46:51,211 INFO L158 Benchmark]: RCFGBuilder took 598.65ms. Allocated memory is still 100.7MB. Free memory was 56.1MB in the beginning and 68.1MB in the end (delta: -12.0MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-11-07 03:46:51,212 INFO L158 Benchmark]: TraceAbstraction took 2090.61ms. Allocated memory is still 100.7MB. Free memory was 67.6MB in the beginning and 36.8MB in the end (delta: 30.9MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2024-11-07 03:46:51,212 INFO L158 Benchmark]: Witness Printer took 4.52ms. Allocated memory is still 100.7MB. Free memory was 36.8MB in the beginning and 36.8MB in the end (delta: 14.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:46:51,213 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.78ms. Allocated memory is still 83.9MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.97ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 63.2MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.38ms. Allocated memory is still 100.7MB. Free memory was 63.2MB in the beginning and 58.9MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.00ms. Allocated memory is still 100.7MB. Free memory was 58.9MB in the beginning and 56.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 598.65ms. Allocated memory is still 100.7MB. Free memory was 56.1MB in the beginning and 68.1MB in the end (delta: -12.0MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2090.61ms. Allocated memory is still 100.7MB. Free memory was 67.6MB in the beginning and 36.8MB in the end (delta: 30.9MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * Witness Printer took 4.52ms. Allocated memory is still 100.7MB. Free memory was 36.8MB in the beginning and 36.8MB in the end (delta: 14.7kB). 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 126. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 32); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (32 - 1); [L35] const SORT_32 mask_SORT_32 = (SORT_32)-1 >> (sizeof(SORT_32) * 8 - 4); [L36] const SORT_32 msb_SORT_32 = (SORT_32)1 << (4 - 1); [L38] const SORT_68 mask_SORT_68 = (SORT_68)-1 >> (sizeof(SORT_68) * 8 - 10); [L39] const SORT_68 msb_SORT_68 = (SORT_68)1 << (10 - 1); [L41] const SORT_1 var_7 = 0; [L42] const SORT_10 var_12 = 0; [L43] const SORT_1 var_22 = 1; [L45] SORT_1 input_2; [L46] SORT_3 input_4; [L47] SORT_1 input_5; [L48] SORT_1 input_6; [L49] SORT_1 input_28; [L50] SORT_1 input_30; [L51] SORT_32 input_33; [L52] SORT_1 input_35; [L53] SORT_32 input_37; [L54] SORT_1 input_39; [L55] SORT_1 input_41; [L56] SORT_1 input_43; [L57] SORT_1 input_45; [L58] SORT_1 input_47; [L59] SORT_1 input_49; [L60] SORT_1 input_51; [L61] SORT_1 input_53; [L62] SORT_3 input_55; [L63] SORT_1 input_58; [L64] SORT_1 input_60; [L65] SORT_1 input_62; [L66] SORT_1 input_64; [L67] SORT_1 input_66; [L68] SORT_68 input_69; [L69] SORT_1 input_71; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_22=1, var_7=0] [L71] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_22=1, var_7=0] [L72] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_22=1, var_7=0] [L73] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] SORT_1 init_9_arg_1 = var_7; [L76] state_8 = init_9_arg_1 [L77] SORT_1 init_16_arg_1 = var_7; [L78] state_15 = init_16_arg_1 [L79] SORT_1 init_27_arg_1 = var_7; [L80] state_26 = init_27_arg_1 VAL [mask_SORT_1=1, state_15=0, state_26=0, state_8=0, var_12=0, var_22=1, var_7=0] [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_4 = __VERIFIER_nondet_uchar() [L85] input_5 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_28 = __VERIFIER_nondet_uchar() [L88] input_30 = __VERIFIER_nondet_uchar() [L89] input_33 = __VERIFIER_nondet_uchar() [L90] input_35 = __VERIFIER_nondet_uchar() [L91] input_37 = __VERIFIER_nondet_uchar() [L92] input_39 = __VERIFIER_nondet_uchar() [L93] input_41 = __VERIFIER_nondet_uchar() [L94] input_43 = __VERIFIER_nondet_uchar() [L95] input_45 = __VERIFIER_nondet_uchar() [L96] input_47 = __VERIFIER_nondet_uchar() [L97] input_49 = __VERIFIER_nondet_uchar() [L98] input_51 = __VERIFIER_nondet_uchar() [L99] input_53 = __VERIFIER_nondet_uchar() [L100] input_55 = __VERIFIER_nondet_uchar() [L101] input_58 = __VERIFIER_nondet_uchar() [L102] input_60 = __VERIFIER_nondet_uchar() [L103] input_62 = __VERIFIER_nondet_uchar() [L104] input_64 = __VERIFIER_nondet_uchar() [L105] input_66 = __VERIFIER_nondet_uchar() [L106] input_69 = __VERIFIER_nondet_ushort() [L107] input_71 = __VERIFIER_nondet_uchar() [L110] SORT_1 var_11_arg_0 = state_8; VAL [mask_SORT_1=1, state_15=0, state_26=0, state_8=0, var_11_arg_0=0, var_12=0, var_22=1, var_7=0] [L111] EXPR var_11_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_15=0, state_26=0, state_8=0, var_12=0, var_22=1, var_7=0] [L111] var_11_arg_0 = var_11_arg_0 & mask_SORT_1 [L112] SORT_10 var_11 = var_11_arg_0; [L113] SORT_10 var_13_arg_0 = var_11; [L114] SORT_10 var_13_arg_1 = var_12; [L115] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L116] SORT_1 var_14_arg_0 = var_13; [L117] SORT_1 var_14 = ~var_14_arg_0; [L118] SORT_1 var_17_arg_0 = state_15; VAL [mask_SORT_1=1, state_15=0, state_26=0, state_8=0, var_12=0, var_14=-2, var_17_arg_0=0, var_22=1, var_7=0] [L119] EXPR var_17_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_15=0, state_26=0, state_8=0, var_12=0, var_14=-2, var_22=1, var_7=0] [L119] var_17_arg_0 = var_17_arg_0 & mask_SORT_1 [L120] SORT_10 var_17 = var_17_arg_0; [L121] SORT_10 var_18_arg_0 = var_17; [L122] SORT_10 var_18_arg_1 = var_12; [L123] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L124] SORT_1 var_19_arg_0 = var_14; [L125] SORT_1 var_19_arg_1 = var_18; VAL [mask_SORT_1=1, state_15=0, state_26=0, state_8=0, var_12=0, var_19_arg_0=-2, var_19_arg_1=1, var_22=1, var_7=0] [L126] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_1=1, state_15=0, state_26=0, state_8=0, var_12=0, var_22=1, var_7=0] [L126] SORT_1 var_19 = var_19_arg_0 | var_19_arg_1; [L127] SORT_1 var_23_arg_0 = var_19; [L128] SORT_1 var_23 = ~var_23_arg_0; [L129] SORT_1 var_24_arg_0 = var_22; [L130] SORT_1 var_24_arg_1 = var_23; VAL [mask_SORT_1=1, state_15=0, state_26=0, state_8=0, var_12=0, var_22=1, var_24_arg_0=1, var_24_arg_1=-255, var_7=0] [L131] EXPR var_24_arg_0 & var_24_arg_1 VAL [mask_SORT_1=1, state_15=0, state_26=0, state_8=0, var_12=0, var_22=1, var_7=0] [L131] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L132] EXPR var_24 & mask_SORT_1 VAL [mask_SORT_1=1, state_15=0, state_26=0, state_8=0, var_12=0, var_22=1, var_7=0] [L132] var_24 = var_24 & mask_SORT_1 [L133] SORT_1 bad_25_arg_0 = var_24; [L134] CALL __VERIFIER_assert(!(bad_25_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 652 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 424 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 228 mSDtfsCounter, 63 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=4, InterpolantAutomatonStates: 17, 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, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 115 NumberOfCodeBlocks, 115 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 186 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 03:46:51,242 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 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.vcegar_QF_BV_itc99_b13_p17.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 53546c4dcb2cff2eaca8f311738b2b6b829a702db585862ee7ca5a0b611bb252 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:46:53,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:46:53,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-07 03:46:53,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:46:53,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:46:53,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:46:53,696 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:46:53,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:46:53,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:46:53,697 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:46:53,697 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:46:53,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:46:53,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:46:53,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:46:53,698 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:46:53,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:46:53,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:46:53,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:46:53,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:46:53,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:46:53,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:46:53,698 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 03:46:53,698 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 03:46:53,698 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:46:53,698 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 03:46:53,698 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:46:53,698 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:46:53,699 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:46:53,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:46:53,699 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:46:53,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:46:53,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:46:53,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:46:53,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:46:53,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:46:53,700 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 03:46:53,700 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 03:46:53,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:46:53,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:46:53,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:46:53,701 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:46:53,701 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 -> 53546c4dcb2cff2eaca8f311738b2b6b829a702db585862ee7ca5a0b611bb252 [2024-11-07 03:46:54,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:46:54,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:46:54,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:46:54,044 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:46:54,045 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:46:54,046 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.vcegar_QF_BV_itc99_b13_p17.c [2024-11-07 03:46:55,381 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:46:55,634 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:46:55,636 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p17.c [2024-11-07 03:46:55,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5fec3b10f/ba51f1823a2a4a948d1d2ab255b321ad/FLAG5d380c54f [2024-11-07 03:46:55,956 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5fec3b10f/ba51f1823a2a4a948d1d2ab255b321ad [2024-11-07 03:46:55,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:46:55,960 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:46:55,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:46:55,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:46:55,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:46:55,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:46:55" (1/1) ... [2024-11-07 03:46:55,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@203b91ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:55, skipping insertion in model container [2024-11-07 03:46:55,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:46:55" (1/1) ... [2024-11-07 03:46:55,984 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:46:56,108 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.vcegar_QF_BV_itc99_b13_p17.c[1266,1279] [2024-11-07 03:46:56,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:46:56,187 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:46:56,196 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.vcegar_QF_BV_itc99_b13_p17.c[1266,1279] [2024-11-07 03:46:56,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:46:56,229 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:46:56,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:56 WrapperNode [2024-11-07 03:46:56,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:46:56,232 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:46:56,232 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:46:56,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:46:56,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:56" (1/1) ... [2024-11-07 03:46:56,247 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:56" (1/1) ... [2024-11-07 03:46:56,278 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 191 [2024-11-07 03:46:56,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:46:56,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:46:56,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:46:56,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:46:56,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:56" (1/1) ... [2024-11-07 03:46:56,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:56" (1/1) ... [2024-11-07 03:46:56,290 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:56" (1/1) ... [2024-11-07 03:46:56,308 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 03:46:56,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:56" (1/1) ... [2024-11-07 03:46:56,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:56" (1/1) ... [2024-11-07 03:46:56,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:56" (1/1) ... [2024-11-07 03:46:56,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:56" (1/1) ... [2024-11-07 03:46:56,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:56" (1/1) ... [2024-11-07 03:46:56,319 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:56" (1/1) ... [2024-11-07 03:46:56,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:46:56,324 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:46:56,324 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:46:56,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:46:56,325 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:56" (1/1) ... [2024-11-07 03:46:56,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:46:56,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:46:56,367 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 03:46:56,371 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 03:46:56,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:46:56,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 03:46:56,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:46:56,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:46:56,487 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:46:56,489 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:46:56,654 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2024-11-07 03:46:56,654 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:46:56,661 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:46:56,661 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:46:56,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:46:56 BoogieIcfgContainer [2024-11-07 03:46:56,662 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:46:56,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:46:56,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:46:56,670 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:46:56,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:46:55" (1/3) ... [2024-11-07 03:46:56,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24aee8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:46:56, skipping insertion in model container [2024-11-07 03:46:56,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:56" (2/3) ... [2024-11-07 03:46:56,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24aee8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:46:56, skipping insertion in model container [2024-11-07 03:46:56,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:46:56" (3/3) ... [2024-11-07 03:46:56,672 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p17.c [2024-11-07 03:46:56,685 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:46:56,686 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:46:56,725 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:46:56,736 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;@129fd65a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:46:56,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:46:56,743 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 03:46:56,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 03:46:56,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:46:56,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 03:46:56,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:46:56,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:46:56,754 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-07 03:46:56,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:46:56,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623676623] [2024-11-07 03:46:56,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:46:56,763 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 03:46:56,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:46:56,767 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 03:46:56,788 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 03:46:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:46:56,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 03:46:56,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:46:57,209 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 03:46:57,209 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:46:57,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:46:57,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623676623] [2024-11-07 03:46:57,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623676623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:46:57,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:46:57,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:46:57,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242326744] [2024-11-07 03:46:57,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:46:57,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:46:57,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:46:57,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:46:57,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:46:57,235 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 03:46:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:46:57,273 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2024-11-07 03:46:57,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:46:57,276 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 03:46:57,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:46:57,281 INFO L225 Difference]: With dead ends: 13 [2024-11-07 03:46:57,282 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 03:46:57,285 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 03:46:57,288 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:46:57,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:46:57,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 03:46:57,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 03:46:57,308 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 03:46:57,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 03:46:57,313 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2024-11-07 03:46:57,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:46:57,314 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 03:46:57,314 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 03:46:57,314 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 03:46:57,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 03:46:57,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 03:46:57,320 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 03:46:57,517 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 03:46:57,520 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-07 03:46:57,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 03:46:57,540 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 03:46:57,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:46:57 BoogieIcfgContainer [2024-11-07 03:46:57,557 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 03:46:57,558 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 03:46:57,558 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 03:46:57,559 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 03:46:57,560 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:46:56" (3/4) ... [2024-11-07 03:46:57,562 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 03:46:57,570 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-07 03:46:57,572 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 03:46:57,572 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 03:46:57,573 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 03:46:57,659 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 03:46:57,660 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 03:46:57,660 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 03:46:57,661 INFO L158 Benchmark]: Toolchain (without parser) took 1700.62ms. Allocated memory is still 83.9MB. Free memory was 60.2MB in the beginning and 44.4MB in the end (delta: 15.8MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2024-11-07 03:46:57,661 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 66.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:46:57,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.12ms. Allocated memory is still 83.9MB. Free memory was 60.2MB in the beginning and 46.7MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 03:46:57,662 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.92ms. Allocated memory is still 83.9MB. Free memory was 46.7MB in the beginning and 44.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:46:57,663 INFO L158 Benchmark]: Boogie Preprocessor took 44.33ms. Allocated memory is still 83.9MB. Free memory was 44.9MB in the beginning and 42.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:46:57,663 INFO L158 Benchmark]: RCFGBuilder took 337.67ms. Allocated memory is still 83.9MB. Free memory was 42.8MB in the beginning and 28.5MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 03:46:57,664 INFO L158 Benchmark]: TraceAbstraction took 893.24ms. Allocated memory is still 83.9MB. Free memory was 27.9MB in the beginning and 50.5MB in the end (delta: -22.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:46:57,664 INFO L158 Benchmark]: Witness Printer took 101.50ms. Allocated memory is still 83.9MB. Free memory was 50.5MB in the beginning and 44.4MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 03:46:57,665 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.20ms. Allocated memory is still 83.9MB. Free memory is still 66.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.12ms. Allocated memory is still 83.9MB. Free memory was 60.2MB in the beginning and 46.7MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.92ms. Allocated memory is still 83.9MB. Free memory was 46.7MB in the beginning and 44.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.33ms. Allocated memory is still 83.9MB. Free memory was 44.9MB in the beginning and 42.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 337.67ms. Allocated memory is still 83.9MB. Free memory was 42.8MB in the beginning and 28.5MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 893.24ms. Allocated memory is still 83.9MB. Free memory was 27.9MB in the beginning and 50.5MB in the end (delta: -22.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 101.50ms. Allocated memory is still 83.9MB. Free memory was 50.5MB in the beginning and 44.4MB in the end (delta: 6.0MB). 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.8s, 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.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 2 mSDtfsCounter, 5 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: 4, 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.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 SizeOfPredicates, 4 NumberOfNonLiveVariables, 56 ConjunctsInSsa, 20 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: 81]: Loop Invariant Derived loop invariant: (((0 == var_12) && (0 == state_15)) && (1 == mask_SORT_1)) RESULT: Ultimate proved your program to be correct! [2024-11-07 03:46:57,694 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 Writing output log to file Ultimate.log Result: TRUE