./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/rule57_ebda_blast_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/ldv-regression/rule57_ebda_blast_2.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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', '32bit', '--witnessprinter.graph.data.programhash', '18e93ea431e83188bc36b5e920f02065de4d876f2ec76df16cf4e34ae99f6b21'] 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/ldv-regression/rule57_ebda_blast_2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 18e93ea431e83188bc36b5e920f02065de4d876f2ec76df16cf4e34ae99f6b21 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 22:18:50,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 22:18:50,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 22:18:50,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 22:18:50,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 22:18:50,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 22:18:50,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 22:18:50,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 22:18:50,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 22:18:50,912 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 22:18:50,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 22:18:50,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 22:18:50,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 22:18:50,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 22:18:50,913 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 22:18:50,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 22:18:50,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 22:18:50,914 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 22:18:50,914 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 22:18:50,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 22:18:50,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 22:18:50,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 22:18:50,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 22:18:50,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 22:18:50,914 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 22:18:50,914 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 22:18:50,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 22:18:50,914 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 22:18:50,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 22:18:50,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 22:18:50,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 22:18:50,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 22:18:50,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:18:50,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 22:18:50,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 22:18:50,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 22:18:50,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 22:18:50,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 22:18:50,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 22:18:50,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 22:18:50,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 22:18:50,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 22:18:50,915 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 18e93ea431e83188bc36b5e920f02065de4d876f2ec76df16cf4e34ae99f6b21 [2024-11-06 22:18:51,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 22:18:51,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 22:18:51,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 22:18:51,198 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 22:18:51,198 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 22:18:51,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/rule57_ebda_blast_2.i [2024-11-06 22:18:52,380 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 22:18:52,602 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 22:18:52,602 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule57_ebda_blast_2.i [2024-11-06 22:18:52,619 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bbd1f15f/adff98ab22fd465e83e1aca7b6cfc3ed/FLAG4b9c0066f [2024-11-06 22:18:52,956 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bbd1f15f/adff98ab22fd465e83e1aca7b6cfc3ed [2024-11-06 22:18:52,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 22:18:52,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 22:18:52,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 22:18:52,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 22:18:52,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 22:18:52,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:18:52" (1/1) ... [2024-11-06 22:18:52,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f24288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:52, skipping insertion in model container [2024-11-06 22:18:52,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:18:52" (1/1) ... [2024-11-06 22:18:52,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 22:18:53,174 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/ldv-regression/rule57_ebda_blast_2.i[341,354] [2024-11-06 22:18:53,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:18:53,245 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 22:18:53,258 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/ldv-regression/rule57_ebda_blast_2.i[341,354] [2024-11-06 22:18:53,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:18:53,304 INFO L204 MainTranslator]: Completed translation [2024-11-06 22:18:53,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:53 WrapperNode [2024-11-06 22:18:53,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 22:18:53,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 22:18:53,310 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 22:18:53,310 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 22:18:53,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:53" (1/1) ... [2024-11-06 22:18:53,328 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:53" (1/1) ... [2024-11-06 22:18:53,360 INFO L138 Inliner]: procedures = 24, calls = 25, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 111 [2024-11-06 22:18:53,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 22:18:53,362 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 22:18:53,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 22:18:53,366 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 22:18:53,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:53" (1/1) ... [2024-11-06 22:18:53,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:53" (1/1) ... [2024-11-06 22:18:53,382 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:53" (1/1) ... [2024-11-06 22:18:53,406 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2024-11-06 22:18:53,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:53" (1/1) ... [2024-11-06 22:18:53,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:53" (1/1) ... [2024-11-06 22:18:53,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:53" (1/1) ... [2024-11-06 22:18:53,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:53" (1/1) ... [2024-11-06 22:18:53,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:53" (1/1) ... [2024-11-06 22:18:53,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:53" (1/1) ... [2024-11-06 22:18:53,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 22:18:53,424 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 22:18:53,424 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 22:18:53,424 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 22:18:53,424 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:53" (1/1) ... [2024-11-06 22:18:53,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:18:53,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:18:53,449 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-06 22:18:53,455 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-06 22:18:53,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-06 22:18:53,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-06 22:18:53,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 22:18:53,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 22:18:53,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 22:18:53,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-06 22:18:53,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-06 22:18:53,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-06 22:18:53,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-06 22:18:53,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-06 22:18:53,471 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2024-11-06 22:18:53,471 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2024-11-06 22:18:53,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 22:18:53,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 22:18:53,542 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 22:18:53,543 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 22:18:53,714 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-06 22:18:53,715 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 22:18:53,722 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 22:18:53,723 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-06 22:18:53,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:18:53 BoogieIcfgContainer [2024-11-06 22:18:53,723 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 22:18:53,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 22:18:53,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 22:18:53,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 22:18:53,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:18:52" (1/3) ... [2024-11-06 22:18:53,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e66297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:18:53, skipping insertion in model container [2024-11-06 22:18:53,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:53" (2/3) ... [2024-11-06 22:18:53,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e66297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:18:53, skipping insertion in model container [2024-11-06 22:18:53,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:18:53" (3/3) ... [2024-11-06 22:18:53,733 INFO L112 eAbstractionObserver]: Analyzing ICFG rule57_ebda_blast_2.i [2024-11-06 22:18:53,743 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 22:18:53,743 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 22:18:53,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 22:18:53,799 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;@6e7de4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 22:18:53,799 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 22:18:53,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 22:18:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-06 22:18:53,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:18:53,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:18:53,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:18:53,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:18:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1871847266, now seen corresponding path program 1 times [2024-11-06 22:18:53,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:18:53,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895461536] [2024-11-06 22:18:53,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:53,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:18:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:54,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:18:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:54,177 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-06 22:18:54,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:18:54,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895461536] [2024-11-06 22:18:54,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895461536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:18:54,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:18:54,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 22:18:54,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889938637] [2024-11-06 22:18:54,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:18:54,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 22:18:54,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:18:54,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 22:18:54,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:18:54,212 INFO L87 Difference]: Start difference. First operand has 34 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:18:54,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:18:54,265 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2024-11-06 22:18:54,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 22:18:54,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-06 22:18:54,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:18:54,271 INFO L225 Difference]: With dead ends: 45 [2024-11-06 22:18:54,271 INFO L226 Difference]: Without dead ends: 32 [2024-11-06 22:18:54,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:18:54,275 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:18:54,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 178 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:18:54,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-06 22:18:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-06 22:18:54,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 22:18:54,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-06 22:18:54,297 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2024-11-06 22:18:54,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:18:54,298 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-06 22:18:54,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:18:54,299 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-06 22:18:54,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-06 22:18:54,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:18:54,300 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:18:54,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 22:18:54,300 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:18:54,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:18:54,301 INFO L85 PathProgramCache]: Analyzing trace with hash -386867877, now seen corresponding path program 1 times [2024-11-06 22:18:54,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:18:54,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207747686] [2024-11-06 22:18:54,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:54,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:18:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:54,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:18:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:54,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:18:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 22:18:54,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:18:54,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207747686] [2024-11-06 22:18:54,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207747686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:18:54,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:18:54,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 22:18:54,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277544405] [2024-11-06 22:18:54,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:18:54,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 22:18:54,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:18:54,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 22:18:54,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:18:54,476 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 22:18:54,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:18:54,564 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-06 22:18:54,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 22:18:54,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-06 22:18:54,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:18:54,565 INFO L225 Difference]: With dead ends: 40 [2024-11-06 22:18:54,565 INFO L226 Difference]: Without dead ends: 34 [2024-11-06 22:18:54,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-06 22:18:54,567 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 26 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:18:54,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 148 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:18:54,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-06 22:18:54,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-06 22:18:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 22:18:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-11-06 22:18:54,575 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 21 [2024-11-06 22:18:54,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:18:54,575 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-06 22:18:54,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 22:18:54,575 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-11-06 22:18:54,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-06 22:18:54,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:18:54,576 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:18:54,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 22:18:54,576 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:18:54,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:18:54,577 INFO L85 PathProgramCache]: Analyzing trace with hash 136719165, now seen corresponding path program 1 times [2024-11-06 22:18:54,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:18:54,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266503930] [2024-11-06 22:18:54,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:54,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:18:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:54,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:18:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:54,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:18:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:54,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:18:54,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:18:54,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266503930] [2024-11-06 22:18:54,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266503930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:18:54,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:18:54,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:18:54,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130191818] [2024-11-06 22:18:54,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:18:54,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:18:54,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:18:54,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:18:54,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:18:54,696 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 22:18:54,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:18:54,740 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2024-11-06 22:18:54,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 22:18:54,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-11-06 22:18:54,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:18:54,741 INFO L225 Difference]: With dead ends: 41 [2024-11-06 22:18:54,741 INFO L226 Difference]: Without dead ends: 34 [2024-11-06 22:18:54,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-06 22:18:54,742 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:18:54,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 86 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:18:54,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-06 22:18:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-06 22:18:54,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 22:18:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-11-06 22:18:54,750 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2024-11-06 22:18:54,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:18:54,751 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-11-06 22:18:54,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 22:18:54,751 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-11-06 22:18:54,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-06 22:18:54,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:18:54,752 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:18:54,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 22:18:54,752 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:18:54,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:18:54,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1911726527, now seen corresponding path program 1 times [2024-11-06 22:18:54,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:18:54,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314080589] [2024-11-06 22:18:54,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:54,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:18:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 22:18:54,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 22:18:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 22:18:54,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-06 22:18:54,821 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 22:18:54,822 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 22:18:54,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 22:18:54,825 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-06 22:18:54,850 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 22:18:54,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:18:54 BoogieIcfgContainer [2024-11-06 22:18:54,855 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 22:18:54,856 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 22:18:54,856 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 22:18:54,856 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 22:18:54,856 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:18:53" (3/4) ... [2024-11-06 22:18:54,857 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-06 22:18:54,890 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 22:18:54,890 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 22:18:54,890 INFO L158 Benchmark]: Toolchain (without parser) took 1928.12ms. Allocated memory is still 100.7MB. Free memory was 77.4MB in the beginning and 36.3MB in the end (delta: 41.1MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2024-11-06 22:18:54,890 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:18:54,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.83ms. Allocated memory is still 100.7MB. Free memory was 77.3MB in the beginning and 65.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:18:54,891 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.85ms. Allocated memory is still 100.7MB. Free memory was 65.6MB in the beginning and 64.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:18:54,891 INFO L158 Benchmark]: Boogie Preprocessor took 60.75ms. Allocated memory is still 100.7MB. Free memory was 64.2MB in the beginning and 62.3MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:18:54,893 INFO L158 Benchmark]: RCFGBuilder took 299.41ms. Allocated memory is still 100.7MB. Free memory was 62.1MB in the beginning and 47.8MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:18:54,894 INFO L158 Benchmark]: TraceAbstraction took 1129.45ms. Allocated memory is still 100.7MB. Free memory was 47.1MB in the beginning and 38.8MB in the end (delta: 8.3MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2024-11-06 22:18:54,894 INFO L158 Benchmark]: Witness Printer took 34.17ms. Allocated memory is still 100.7MB. Free memory was 38.8MB in the beginning and 36.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:18:54,895 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.15ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.83ms. Allocated memory is still 100.7MB. Free memory was 77.3MB in the beginning and 65.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.85ms. Allocated memory is still 100.7MB. Free memory was 65.6MB in the beginning and 64.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.75ms. Allocated memory is still 100.7MB. Free memory was 64.2MB in the beginning and 62.3MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 299.41ms. Allocated memory is still 100.7MB. Free memory was 62.1MB in the beginning and 47.8MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1129.45ms. Allocated memory is still 100.7MB. Free memory was 47.1MB in the beginning and 38.8MB in the end (delta: 8.3MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Witness Printer took 34.17ms. Allocated memory is still 100.7MB. Free memory was 38.8MB in the beginning and 36.3MB in the end (delta: 2.5MB). 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 - CounterExampleResult [Line: 9]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] struct slot *tmp_slot; [L43] int used_tmp_slot = 0; [L44] int freed_tmp_slot = 1; VAL [freed_tmp_slot=1, tmp_slot={0:0}, used_tmp_slot=0] [L138] CALL ebda_rsrc_controller() [L75] struct hotplug_slot *hp_slot_ptr; [L77] struct bus_info *bus_info_ptr1; [L78] int rc; VAL [freed_tmp_slot=1, tmp_slot={0:0}, used_tmp_slot=0] [L80] CALL, EXPR kzalloc(sizeof(*hp_slot_ptr), 1) VAL [freed_tmp_slot=1, tmp_slot={0:0}, used_tmp_slot=0] [L49] EXPR, FCALL calloc(1, size) [L49] return calloc(1, size); [L80] RET, EXPR kzalloc(sizeof(*hp_slot_ptr), 1) VAL [freed_tmp_slot=1, tmp_slot={0:0}, used_tmp_slot=0] [L80] hp_slot_ptr = kzalloc(sizeof(*hp_slot_ptr), 1) [L81] COND FALSE !(!hp_slot_ptr) [L85] hp_slot_ptr->b = 5 VAL [freed_tmp_slot=1, tmp_slot={0:0}, used_tmp_slot=0] [L87] CALL, EXPR kzalloc(sizeof(*tmp_slot), 1) VAL [freed_tmp_slot=1, tmp_slot={0:0}, used_tmp_slot=0] [L49] EXPR, FCALL calloc(1, size) [L49] return calloc(1, size); [L87] RET, EXPR kzalloc(sizeof(*tmp_slot), 1) VAL [freed_tmp_slot=1, hp_slot_ptr={-1:0}, tmp_slot={0:0}, used_tmp_slot=0] [L87] tmp_slot = kzalloc(sizeof(*tmp_slot), 1) [L89] COND FALSE !(!tmp_slot) [L94] used_tmp_slot = 0 [L95] freed_tmp_slot = 0 [L97] tmp_slot->a = 2 [L98] tmp_slot->b = 3 [L100] CALL, EXPR ibmphp_find_same_bus_num() [L58] COND TRUE __VERIFIER_nondet_int() [L59] return 0; VAL [\result={0:0}, freed_tmp_slot=0, tmp_slot={-2:0}, used_tmp_slot=0] [L100] RET, EXPR ibmphp_find_same_bus_num() [L100] bus_info_ptr1 = ibmphp_find_same_bus_num() [L101] COND TRUE !bus_info_ptr1 [L102] rc = -3 VAL [freed_tmp_slot=0, hp_slot_ptr={-1:0}, rc=-3, tmp_slot={-2:0}, used_tmp_slot=0] [L129] EXPR hp_slot_ptr->private [L129] CALL kfree(hp_slot_ptr->private) [L52] COND FALSE !(p!=0 && p==tmp_slot) VAL [freed_tmp_slot=0, tmp_slot={-2:0}, used_tmp_slot=0] [L129] RET kfree(hp_slot_ptr->private) [L134] return rc; VAL [\result=-3, freed_tmp_slot=0, tmp_slot={-2:0}, used_tmp_slot=0] [L138] RET ebda_rsrc_controller() [L139] COND TRUE !used_tmp_slot VAL [freed_tmp_slot=0, tmp_slot={-2:0}, used_tmp_slot=0] [L140] (freed_tmp_slot) ? (0) : __blast_assert () [L140] CALL __blast_assert () [L9] reach_error() VAL [freed_tmp_slot=0, tmp_slot={-2:0}, used_tmp_slot=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 412 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 313 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 99 IncrementalHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 99 mSDtfsCounter, 99 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, InterpolantAutomatonStates: 22, 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, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 59 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 8/8 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 proved your program to be incorrect! [2024-11-06 22:18:54,918 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE