./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1489855b7530896bdd176b2b4b6c40b97d8289986908954c704880efe20dffb0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:18:01,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:18:01,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 10:18:01,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:18:01,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:18:01,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:18:01,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:18:01,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:18:01,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:18:01,775 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:18:01,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:18:01,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:18:01,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:18:01,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:18:01,779 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:18:01,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:18:01,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:18:01,780 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:18:01,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:18:01,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:18:01,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:18:01,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:18:01,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:18:01,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:18:01,786 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:18:01,786 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:18:01,786 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:18:01,786 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:18:01,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:18:01,787 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:18:01,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:18:01,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:18:01,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:18:01,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:18:01,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:18:01,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:18:01,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:18:01,789 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:18:01,789 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:18:01,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:18:01,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:18:01,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:18:01,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:18:01,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:18:01,792 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) 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 -> 1489855b7530896bdd176b2b4b6c40b97d8289986908954c704880efe20dffb0 [2024-11-19 10:18:02,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:18:02,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:18:02,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:18:02,075 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:18:02,075 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:18:02,077 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i [2024-11-19 10:18:03,463 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:18:03,742 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:18:03,743 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i [2024-11-19 10:18:03,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed0bce24/b91fbfa532ba47b9bb6d277c1f5b8298/FLAG5a3733caf [2024-11-19 10:18:04,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed0bce24/b91fbfa532ba47b9bb6d277c1f5b8298 [2024-11-19 10:18:04,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:18:04,040 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:18:04,041 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:18:04,041 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:18:04,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:18:04,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:18:04" (1/1) ... [2024-11-19 10:18:04,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@405deb42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:04, skipping insertion in model container [2024-11-19 10:18:04,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:18:04" (1/1) ... [2024-11-19 10:18:04,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:18:04,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:18:04,387 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:18:04,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:18:04,467 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:18:04,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:04 WrapperNode [2024-11-19 10:18:04,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:18:04,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:18:04,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:18:04,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:18:04,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:04" (1/1) ... [2024-11-19 10:18:04,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:04" (1/1) ... [2024-11-19 10:18:04,520 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2024-11-19 10:18:04,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:18:04,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:18:04,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:18:04,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:18:04,531 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:04" (1/1) ... [2024-11-19 10:18:04,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:04" (1/1) ... [2024-11-19 10:18:04,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:04" (1/1) ... [2024-11-19 10:18:04,556 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 11, 31]. 70 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 18 writes are split as follows [0, 2, 16]. [2024-11-19 10:18:04,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:04" (1/1) ... [2024-11-19 10:18:04,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:04" (1/1) ... [2024-11-19 10:18:04,571 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:04" (1/1) ... [2024-11-19 10:18:04,580 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:04" (1/1) ... [2024-11-19 10:18:04,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:04" (1/1) ... [2024-11-19 10:18:04,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:04" (1/1) ... [2024-11-19 10:18:04,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:18:04,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:18:04,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:18:04,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:18:04,602 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:04" (1/1) ... [2024-11-19 10:18:04,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:18:04,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:18:04,632 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 10:18:04,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 10:18:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 10:18:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 10:18:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 10:18:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 10:18:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 10:18:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 10:18:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 10:18:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2024-11-19 10:18:04,695 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2024-11-19 10:18:04,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:18:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 10:18:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 10:18:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 10:18:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 10:18:04,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 10:18:04,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 10:18:04,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 10:18:04,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 10:18:04,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 10:18:04,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 10:18:04,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 10:18:04,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 10:18:04,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 10:18:04,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 10:18:04,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:18:04,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:18:04,837 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:18:04,838 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:18:05,176 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-19 10:18:05,176 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:18:05,192 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:18:05,192 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-19 10:18:05,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:05 BoogieIcfgContainer [2024-11-19 10:18:05,193 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:18:05,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:18:05,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:18:05,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:18:05,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:18:04" (1/3) ... [2024-11-19 10:18:05,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2155abca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:18:05, skipping insertion in model container [2024-11-19 10:18:05,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:04" (2/3) ... [2024-11-19 10:18:05,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2155abca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:18:05, skipping insertion in model container [2024-11-19 10:18:05,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:05" (3/3) ... [2024-11-19 10:18:05,204 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-1.i [2024-11-19 10:18:05,218 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:18:05,218 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-19 10:18:05,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:18:05,274 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;@508cbbaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:18:05,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-19 10:18:05,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 47 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 10:18:05,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:05,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:18:05,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:18:05,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:05,291 INFO L85 PathProgramCache]: Analyzing trace with hash 599351698, now seen corresponding path program 1 times [2024-11-19 10:18:05,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:05,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837819535] [2024-11-19 10:18:05,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:05,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:05,691 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-19 10:18:05,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:05,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837819535] [2024-11-19 10:18:05,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837819535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:18:05,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:18:05,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:18:05,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459096730] [2024-11-19 10:18:05,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:18:05,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:18:05,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:05,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:18:05,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:18:05,732 INFO L87 Difference]: Start difference. First operand has 51 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 47 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:18:05,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:05,785 INFO L93 Difference]: Finished difference Result 104 states and 144 transitions. [2024-11-19 10:18:05,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:18:05,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-19 10:18:05,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:05,793 INFO L225 Difference]: With dead ends: 104 [2024-11-19 10:18:05,794 INFO L226 Difference]: Without dead ends: 48 [2024-11-19 10:18:05,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-19 10:18:05,799 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 1 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:05,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 173 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:18:05,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-19 10:18:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-19 10:18:05,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 44 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:05,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2024-11-19 10:18:05,834 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 11 [2024-11-19 10:18:05,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:05,834 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-11-19 10:18:05,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:18:05,835 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2024-11-19 10:18:05,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 10:18:05,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:05,837 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:18:05,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:18:05,837 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:18:05,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:05,838 INFO L85 PathProgramCache]: Analyzing trace with hash -29126898, now seen corresponding path program 1 times [2024-11-19 10:18:05,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:05,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498556561] [2024-11-19 10:18:05,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:05,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:06,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 10:18:06,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:06,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498556561] [2024-11-19 10:18:06,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498556561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:18:06,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:18:06,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:18:06,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411279664] [2024-11-19 10:18:06,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:18:06,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:18:06,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:06,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:18:06,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:18:06,048 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:18:06,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:06,109 INFO L93 Difference]: Finished difference Result 128 states and 159 transitions. [2024-11-19 10:18:06,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:18:06,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 10:18:06,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:06,113 INFO L225 Difference]: With dead ends: 128 [2024-11-19 10:18:06,113 INFO L226 Difference]: Without dead ends: 82 [2024-11-19 10:18:06,114 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-19 10:18:06,116 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 34 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:06,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 153 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:18:06,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-19 10:18:06,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2024-11-19 10:18:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 71 states have internal predecessors, (93), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:06,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2024-11-19 10:18:06,133 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 15 [2024-11-19 10:18:06,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:06,133 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2024-11-19 10:18:06,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:18:06,134 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2024-11-19 10:18:06,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 10:18:06,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:06,136 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:18:06,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:18:06,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:18:06,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:06,137 INFO L85 PathProgramCache]: Analyzing trace with hash 650931472, now seen corresponding path program 1 times [2024-11-19 10:18:06,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:06,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461935371] [2024-11-19 10:18:06,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:06,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:06,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:18:06,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:06,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461935371] [2024-11-19 10:18:06,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461935371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:18:06,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243752421] [2024-11-19 10:18:06,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:06,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:18:06,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:18:06,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:18:06,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 10:18:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:06,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:18:06,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:18:06,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:18:06,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:18:06,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243752421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:18:06,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:18:06,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-19 10:18:06,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076462160] [2024-11-19 10:18:06,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:18:06,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:18:06,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:06,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:18:06,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:18:06,548 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:18:06,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:06,587 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2024-11-19 10:18:06,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:18:06,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 10:18:06,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:06,589 INFO L225 Difference]: With dead ends: 76 [2024-11-19 10:18:06,590 INFO L226 Difference]: Without dead ends: 75 [2024-11-19 10:18:06,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:18:06,591 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:06,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 190 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:18:06,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-19 10:18:06,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-19 10:18:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.378787878787879) internal successors, (91), 70 states have internal predecessors, (91), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2024-11-19 10:18:06,605 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 15 [2024-11-19 10:18:06,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:06,606 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2024-11-19 10:18:06,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:18:06,606 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2024-11-19 10:18:06,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 10:18:06,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:06,607 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:18:06,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 10:18:06,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:18:06,812 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:18:06,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:06,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1295960794, now seen corresponding path program 1 times [2024-11-19 10:18:06,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:06,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984681992] [2024-11-19 10:18:06,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:06,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:06,890 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-19 10:18:06,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:06,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984681992] [2024-11-19 10:18:06,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984681992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:18:06,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:18:06,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:18:06,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511051677] [2024-11-19 10:18:06,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:18:06,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:18:06,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:06,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:18:06,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:18:06,894 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:18:06,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:06,920 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2024-11-19 10:18:06,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:18:06,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 10:18:06,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:06,925 INFO L225 Difference]: With dead ends: 75 [2024-11-19 10:18:06,925 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 10:18:06,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-19 10:18:06,926 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:06,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:18:06,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 10:18:06,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2024-11-19 10:18:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 63 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:06,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2024-11-19 10:18:06,940 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 16 [2024-11-19 10:18:06,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:06,941 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2024-11-19 10:18:06,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:18:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2024-11-19 10:18:06,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 10:18:06,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:06,943 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] [2024-11-19 10:18:06,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 10:18:06,943 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:18:06,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:06,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1110772086, now seen corresponding path program 1 times [2024-11-19 10:18:06,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:06,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370795655] [2024-11-19 10:18:06,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:06,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:07,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:18:07,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:07,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370795655] [2024-11-19 10:18:07,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370795655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:18:07,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706961685] [2024-11-19 10:18:07,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:07,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:18:07,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:18:07,066 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:18:07,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 10:18:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:07,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 10:18:07,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:18:07,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:18:07,264 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:18:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:18:07,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706961685] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:18:07,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:18:07,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-19 10:18:07,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899463478] [2024-11-19 10:18:07,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:18:07,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 10:18:07,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:07,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 10:18:07,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:18:07,307 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:18:07,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:07,351 INFO L93 Difference]: Finished difference Result 150 states and 194 transitions. [2024-11-19 10:18:07,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:18:07,352 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-19 10:18:07,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:07,354 INFO L225 Difference]: With dead ends: 150 [2024-11-19 10:18:07,355 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 10:18:07,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:18:07,358 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:07,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 241 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:18:07,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 10:18:07,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-19 10:18:07,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 79 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:07,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2024-11-19 10:18:07,380 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 20 [2024-11-19 10:18:07,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:07,381 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 103 transitions. [2024-11-19 10:18:07,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:18:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2024-11-19 10:18:07,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 10:18:07,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:07,382 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:18:07,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 10:18:07,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:18:07,587 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:18:07,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:07,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1572551298, now seen corresponding path program 2 times [2024-11-19 10:18:07,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:07,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788953461] [2024-11-19 10:18:07,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:18:07,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:07,616 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 10:18:07,632 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:18:07,734 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 10:18:07,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:07,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788953461] [2024-11-19 10:18:07,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788953461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:18:07,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:18:07,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:18:07,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094459838] [2024-11-19 10:18:07,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:18:07,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:18:07,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:07,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:18:07,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:18:07,738 INFO L87 Difference]: Start difference. First operand 84 states and 103 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:18:07,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:07,819 INFO L93 Difference]: Finished difference Result 112 states and 141 transitions. [2024-11-19 10:18:07,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:18:07,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-19 10:18:07,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:07,822 INFO L225 Difference]: With dead ends: 112 [2024-11-19 10:18:07,822 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 10:18:07,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-19 10:18:07,824 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:07,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 130 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:18:07,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 10:18:07,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2024-11-19 10:18:07,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 91 states have internal predecessors, (117), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 121 transitions. [2024-11-19 10:18:07,839 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 121 transitions. Word has length 28 [2024-11-19 10:18:07,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:07,839 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 121 transitions. [2024-11-19 10:18:07,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:18:07,842 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2024-11-19 10:18:07,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 10:18:07,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:07,844 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:18:07,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 10:18:07,845 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:18:07,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:07,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1504449897, now seen corresponding path program 1 times [2024-11-19 10:18:07,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:07,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135047054] [2024-11-19 10:18:07,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:07,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:08,015 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 10:18:08,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:08,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135047054] [2024-11-19 10:18:08,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135047054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:18:08,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:18:08,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:18:08,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414987772] [2024-11-19 10:18:08,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:18:08,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:18:08,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:08,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:18:08,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:18:08,018 INFO L87 Difference]: Start difference. First operand 96 states and 121 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:18:08,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:08,090 INFO L93 Difference]: Finished difference Result 111 states and 139 transitions. [2024-11-19 10:18:08,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:18:08,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-19 10:18:08,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:08,091 INFO L225 Difference]: With dead ends: 111 [2024-11-19 10:18:08,091 INFO L226 Difference]: Without dead ends: 110 [2024-11-19 10:18:08,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:18:08,092 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 21 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:08,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 131 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:18:08,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-19 10:18:08,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2024-11-19 10:18:08,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 93 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:08,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 123 transitions. [2024-11-19 10:18:08,108 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 123 transitions. Word has length 29 [2024-11-19 10:18:08,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:08,109 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 123 transitions. [2024-11-19 10:18:08,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:18:08,109 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 123 transitions. [2024-11-19 10:18:08,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 10:18:08,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:08,110 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:18:08,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 10:18:08,110 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:18:08,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:08,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1625971258, now seen corresponding path program 1 times [2024-11-19 10:18:08,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:08,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741160598] [2024-11-19 10:18:08,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:08,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 10:18:08,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:08,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741160598] [2024-11-19 10:18:08,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741160598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:18:08,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:18:08,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:18:08,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40246331] [2024-11-19 10:18:08,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:18:08,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:18:08,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:08,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:18:08,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:18:08,606 INFO L87 Difference]: Start difference. First operand 98 states and 123 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:18:08,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:08,741 INFO L93 Difference]: Finished difference Result 132 states and 165 transitions. [2024-11-19 10:18:08,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:18:08,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-19 10:18:08,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:08,743 INFO L225 Difference]: With dead ends: 132 [2024-11-19 10:18:08,743 INFO L226 Difference]: Without dead ends: 130 [2024-11-19 10:18:08,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:18:08,744 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 30 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:08,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 159 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:18:08,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-19 10:18:08,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 108. [2024-11-19 10:18:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 100 states have (on average 1.31) internal successors, (131), 103 states have internal predecessors, (131), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:08,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 135 transitions. [2024-11-19 10:18:08,756 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 135 transitions. Word has length 31 [2024-11-19 10:18:08,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:08,757 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 135 transitions. [2024-11-19 10:18:08,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:18:08,757 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 135 transitions. [2024-11-19 10:18:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 10:18:08,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:08,758 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:18:08,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 10:18:08,758 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:18:08,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:08,759 INFO L85 PathProgramCache]: Analyzing trace with hash -745608013, now seen corresponding path program 1 times [2024-11-19 10:18:08,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:08,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437675860] [2024-11-19 10:18:08,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:08,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 10:18:09,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:09,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437675860] [2024-11-19 10:18:09,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437675860] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:18:09,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887592878] [2024-11-19 10:18:09,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:09,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:18:09,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:18:09,421 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:18:09,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 10:18:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:09,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 10:18:09,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:18:09,666 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-19 10:18:09,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 13 [2024-11-19 10:18:09,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 10:18:09,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 11 [2024-11-19 10:18:09,813 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 10:18:09,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-19 10:18:09,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 10:18:09,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 62 [2024-11-19 10:18:09,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 10:18:09,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 42 [2024-11-19 10:18:09,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 9 [2024-11-19 10:18:10,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 10:18:10,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 10:18:10,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 12 [2024-11-19 10:18:10,057 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 10:18:10,057 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:18:10,135 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_create_data_~nextData~0.base_5 Int) (v_ArrVal_589 (Array Int Int)) (create_data_~nextData~0.offset Int) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (or (< 0 (+ 2147483449 (select (select (store (store (store |c_#memory_int#2| c_create_data_~data~0.base v_ArrVal_588) c_create_data_~nextData~0.base v_ArrVal_587) v_create_data_~nextData~0.base_5 v_ArrVal_589) c_create_data_~nextData~0.base) create_data_~nextData~0.offset))) (not (= v_ArrVal_587 (let ((.cse0 (+ create_data_~nextData~0.offset 12))) (store (store (select (store (store |c_#memory_int#2| c_create_data_~nextData~0.base (store (select |c_#memory_int#2| c_create_data_~nextData~0.base) create_data_~nextData~0.offset (+ |c_create_data_#t~mem22| (- 200)))) c_create_data_~data~0.base v_ArrVal_588) c_create_data_~nextData~0.base) (+ create_data_~nextData~0.offset 8) 0) .cse0 (select v_ArrVal_587 .cse0))))) (not (= (select |c_#valid| v_create_data_~nextData~0.base_5) 0)))) is different from false [2024-11-19 10:18:10,198 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_create_data_~nextData~0.base_5 Int) (v_ArrVal_589 (Array Int Int)) (|v_create_data_#t~mem22_9| Int) (create_data_~nextData~0.offset Int) (v_create_data_~nextData~0.base_6 Int) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (or (< |v_create_data_#t~mem22_9| (select (select (store |c_#memory_int#2| v_create_data_~nextData~0.base_6 v_ArrVal_585) c_create_data_~data~0.base) c_create_data_~data~0.offset)) (< 0 (+ (select (select (store (store (store |c_#memory_int#2| c_create_data_~data~0.base v_ArrVal_588) v_create_data_~nextData~0.base_6 v_ArrVal_587) v_create_data_~nextData~0.base_5 v_ArrVal_589) v_create_data_~nextData~0.base_6) create_data_~nextData~0.offset) 2147483449)) (not (= (select (store |c_#valid| v_create_data_~nextData~0.base_6 1) v_create_data_~nextData~0.base_5) 0)) (not (= (select |c_#valid| v_create_data_~nextData~0.base_6) 0)) (not (= (let ((.cse0 (+ create_data_~nextData~0.offset 12))) (store (store (select (store (store |c_#memory_int#2| v_create_data_~nextData~0.base_6 (store v_ArrVal_585 create_data_~nextData~0.offset (+ |v_create_data_#t~mem22_9| (- 200)))) c_create_data_~data~0.base v_ArrVal_588) v_create_data_~nextData~0.base_6) (+ create_data_~nextData~0.offset 8) 0) .cse0 (select v_ArrVal_587 .cse0))) v_ArrVal_587)))) is different from false [2024-11-19 10:18:10,268 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_create_data_~nextData~0.base_5 Int) (v_ArrVal_589 (Array Int Int)) (|v_create_data_#t~mem22_9| Int) (create_data_~nextData~0.offset Int) (v_create_data_~nextData~0.base_6 Int) (v_ArrVal_582 Int) (v_ArrVal_581 Int) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store |c_#memory_int#2| c_create_data_~data~0.base v_ArrVal_588) v_create_data_~nextData~0.base_6 v_ArrVal_587) v_create_data_~nextData~0.base_5 v_ArrVal_589) v_create_data_~nextData~0.base_6) create_data_~nextData~0.offset) 2147483449)) (< |v_create_data_#t~mem22_9| (select (select (store (store |c_#memory_int#2| c_create_data_~data~0.base (store (store (select |c_#memory_int#2| c_create_data_~data~0.base) (+ c_create_data_~data~0.offset 8) v_ArrVal_582) (+ c_create_data_~data~0.offset 12) v_ArrVal_581)) v_create_data_~nextData~0.base_6 v_ArrVal_585) c_create_data_~data~0.base) c_create_data_~data~0.offset)) (not (= (select (store |c_#valid| v_create_data_~nextData~0.base_6 1) v_create_data_~nextData~0.base_5) 0)) (not (= (select |c_#valid| v_create_data_~nextData~0.base_6) 0)) (not (= (let ((.cse0 (+ create_data_~nextData~0.offset 12))) (store (store (select (store (store |c_#memory_int#2| v_create_data_~nextData~0.base_6 (store v_ArrVal_585 create_data_~nextData~0.offset (+ |v_create_data_#t~mem22_9| (- 200)))) c_create_data_~data~0.base v_ArrVal_588) v_create_data_~nextData~0.base_6) (+ create_data_~nextData~0.offset 8) 0) .cse0 (select v_ArrVal_587 .cse0))) v_ArrVal_587)))) is different from false [2024-11-19 10:18:10,429 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 10:18:10,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 10:18:10,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 97 [2024-11-19 10:18:10,455 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-19 10:18:10,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 46 [2024-11-19 10:18:10,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-19 10:18:10,515 INFO L349 Elim1Store]: treesize reduction 58, result has 47.3 percent of original size [2024-11-19 10:18:10,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 79 [2024-11-19 10:18:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 3 not checked. [2024-11-19 10:18:10,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887592878] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:18:10,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:18:10,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 14 [2024-11-19 10:18:10,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401607421] [2024-11-19 10:18:10,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:18:10,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 10:18:10,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:10,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 10:18:10,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=94, Unknown=3, NotChecked=66, Total=210 [2024-11-19 10:18:10,676 INFO L87 Difference]: Start difference. First operand 108 states and 135 transitions. Second operand has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:18:15,023 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| c_create_data_~data~0.base))) (and (= (select |c_#valid| c_create_data_~data~0.base) 1) (= (select .cse0 c_create_data_~data~0.offset) 0) (not (= c_create_data_~data~0.base c_create_data_~nextData~0.base)) (<= 0 |c_create_data_#t~mem22|) (= (select |c_#valid| c_create_data_~nextData~0.base) 1) (forall ((v_create_data_~nextData~0.base_5 Int) (v_ArrVal_589 (Array Int Int)) (create_data_~nextData~0.offset Int) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (or (< 0 (+ 2147483449 (select (select (store (store (store |c_#memory_int#2| c_create_data_~data~0.base v_ArrVal_588) c_create_data_~nextData~0.base v_ArrVal_587) v_create_data_~nextData~0.base_5 v_ArrVal_589) c_create_data_~nextData~0.base) create_data_~nextData~0.offset))) (not (= v_ArrVal_587 (let ((.cse1 (+ create_data_~nextData~0.offset 12))) (store (store (select (store (store |c_#memory_int#2| c_create_data_~nextData~0.base (store (select |c_#memory_int#2| c_create_data_~nextData~0.base) create_data_~nextData~0.offset (+ |c_create_data_#t~mem22| (- 200)))) c_create_data_~data~0.base v_ArrVal_588) c_create_data_~nextData~0.base) (+ create_data_~nextData~0.offset 8) 0) .cse1 (select v_ArrVal_587 .cse1))))) (not (= (select |c_#valid| v_create_data_~nextData~0.base_5) 0)))) (exists ((create_data_~data~0.offset Int)) (= (select .cse0 create_data_~data~0.offset) 0)) (= |c_create_data_#t~mem22| 0))) is different from false [2024-11-19 10:18:19,577 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| c_create_data_~data~0.base) 1) (not (= c_create_data_~data~0.base c_create_data_~nextData~0.base)) (<= 0 |c_create_data_#t~mem22|) (= (select |c_#valid| c_create_data_~nextData~0.base) 1) (forall ((v_create_data_~nextData~0.base_5 Int) (v_ArrVal_589 (Array Int Int)) (create_data_~nextData~0.offset Int) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (or (< 0 (+ 2147483449 (select (select (store (store (store |c_#memory_int#2| c_create_data_~data~0.base v_ArrVal_588) c_create_data_~nextData~0.base v_ArrVal_587) v_create_data_~nextData~0.base_5 v_ArrVal_589) c_create_data_~nextData~0.base) create_data_~nextData~0.offset))) (not (= v_ArrVal_587 (let ((.cse0 (+ create_data_~nextData~0.offset 12))) (store (store (select (store (store |c_#memory_int#2| c_create_data_~nextData~0.base (store (select |c_#memory_int#2| c_create_data_~nextData~0.base) create_data_~nextData~0.offset (+ |c_create_data_#t~mem22| (- 200)))) c_create_data_~data~0.base v_ArrVal_588) c_create_data_~nextData~0.base) (+ create_data_~nextData~0.offset 8) 0) .cse0 (select v_ArrVal_587 .cse0))))) (not (= (select |c_#valid| v_create_data_~nextData~0.base_5) 0)))) (exists ((create_data_~data~0.offset Int)) (= (select (select |c_#memory_int#2| c_create_data_~data~0.base) create_data_~data~0.offset) 0)) (= |c_create_data_#t~mem22| 0)) is different from false [2024-11-19 10:18:20,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:20,459 INFO L93 Difference]: Finished difference Result 146 states and 181 transitions. [2024-11-19 10:18:20,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 10:18:20,459 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-19 10:18:20,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:20,460 INFO L225 Difference]: With dead ends: 146 [2024-11-19 10:18:20,460 INFO L226 Difference]: Without dead ends: 145 [2024-11-19 10:18:20,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=67, Invalid=130, Unknown=5, NotChecked=140, Total=342 [2024-11-19 10:18:20,461 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 60 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:20,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 329 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 99 Invalid, 0 Unknown, 222 Unchecked, 0.4s Time] [2024-11-19 10:18:20,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-19 10:18:20,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 114. [2024-11-19 10:18:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 109 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 143 transitions. [2024-11-19 10:18:20,474 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 143 transitions. Word has length 35 [2024-11-19 10:18:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:20,478 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 143 transitions. [2024-11-19 10:18:20,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:18:20,479 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 143 transitions. [2024-11-19 10:18:20,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 10:18:20,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:20,480 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:18:20,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 10:18:20,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:18:20,682 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:18:20,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:20,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1900915167, now seen corresponding path program 1 times [2024-11-19 10:18:20,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:20,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427933249] [2024-11-19 10:18:20,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:20,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 10:18:20,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 10:18:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 10:18:20,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 10:18:20,761 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 10:18:20,762 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-19 10:18:20,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-19 10:18:20,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-19 10:18:20,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-19 10:18:20,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-19 10:18:20,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-19 10:18:20,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 10:18:20,768 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:18:20,816 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:18:20,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:18:20 BoogieIcfgContainer [2024-11-19 10:18:20,819 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:18:20,820 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:18:20,820 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:18:20,820 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:18:20,821 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:05" (3/4) ... [2024-11-19 10:18:20,821 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 10:18:20,876 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:18:20,876 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:18:20,877 INFO L158 Benchmark]: Toolchain (without parser) took 16837.14ms. Allocated memory was 163.6MB in the beginning and 249.6MB in the end (delta: 86.0MB). Free memory was 116.4MB in the beginning and 166.5MB in the end (delta: -50.1MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2024-11-19 10:18:20,877 INFO L158 Benchmark]: CDTParser took 0.94ms. Allocated memory is still 100.7MB. Free memory is still 66.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:18:20,877 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.68ms. Allocated memory is still 163.6MB. Free memory was 116.4MB in the beginning and 96.3MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 10:18:20,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.67ms. Allocated memory is still 163.6MB. Free memory was 96.3MB in the beginning and 94.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:18:20,877 INFO L158 Benchmark]: Boogie Preprocessor took 75.00ms. Allocated memory is still 163.6MB. Free memory was 94.1MB in the beginning and 90.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 10:18:20,878 INFO L158 Benchmark]: RCFGBuilder took 594.51ms. Allocated memory is still 163.6MB. Free memory was 90.4MB in the beginning and 113.5MB in the end (delta: -23.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 10:18:20,878 INFO L158 Benchmark]: TraceAbstraction took 15621.58ms. Allocated memory was 163.6MB in the beginning and 249.6MB in the end (delta: 86.0MB). Free memory was 112.3MB in the beginning and 168.6MB in the end (delta: -56.3MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-11-19 10:18:20,878 INFO L158 Benchmark]: Witness Printer took 56.36ms. Allocated memory is still 249.6MB. Free memory was 168.6MB in the beginning and 166.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:18:20,880 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.94ms. Allocated memory is still 100.7MB. Free memory is still 66.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 429.68ms. Allocated memory is still 163.6MB. Free memory was 116.4MB in the beginning and 96.3MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.67ms. Allocated memory is still 163.6MB. Free memory was 96.3MB in the beginning and 94.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.00ms. Allocated memory is still 163.6MB. Free memory was 94.1MB in the beginning and 90.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 594.51ms. Allocated memory is still 163.6MB. Free memory was 90.4MB in the beginning and 113.5MB in the end (delta: -23.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15621.58ms. Allocated memory was 163.6MB in the beginning and 249.6MB in the end (delta: 86.0MB). Free memory was 112.3MB in the beginning and 168.6MB in the end (delta: -56.3MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * Witness Printer took 56.36ms. Allocated memory is still 249.6MB. Free memory was 168.6MB in the beginning and 166.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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: 564]: integer overflow possible integer overflow possible We found a FailurePath: [L598] struct node_t *list = ((void *)0); [L598] struct node_t *list = ((void *)0); [L599] int dataNotFinished = 0; VAL [list={3:0}] [L601] CALL append(&list) [L588] struct node_t *node = malloc(sizeof *node); [L589] EXPR \read(**pointerToList) [L589] node->next = *pointerToList [L590] EXPR \read(**pointerToList) [L590] COND TRUE *pointerToList == ((void *)0) [L591] CALL create_data(((void *)0)) VAL [\old(prevData)={0:0}] [L552] prevData != ((void *)0) && prevData->hasNextPartReference VAL [\old(prevData)={0:0}, prevData={0:0}] [L552] prevData != ((void *)0) && prevData->hasNextPartReference VAL [\old(prevData)={0:0}, prevData={0:0}] [L552] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L555] Data data = malloc(sizeof *data); [L556] data->array = (int*) malloc(20 * sizeof(data->array)) [L557] int counter = 0; [L558] counter = 0 VAL [\old(prevData)={0:0}, counter=0, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 3 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=1, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 3 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=2, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 3 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=3, data={-4:0}, prevData={0:0}] [L558] COND FALSE !(counter < 3) VAL [\old(prevData)={0:0}, data={-4:0}, prevData={0:0}] [L561] data->number = 0 [L562] int userInput = __VERIFIER_nondet_int(); [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [\old(prevData)={0:0}, data={-4:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 [L563] EXPR data->number [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [\old(prevData)={0:0}, data={-4:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\old(prevData)={0:0}, data={-4:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L563] EXPR data->number [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\old(prevData)={0:0}, data={-4:0}, prevData={0:0}, userInput=0] [L563] COND TRUE __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200 [L564] EXPR data->number [L564] EXPR data->number + __VERIFIER_nondet_int() [L564] data->number = data->number + __VERIFIER_nondet_int() [L565] userInput = __VERIFIER_nondet_int() [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [\old(prevData)={0:0}, data={-4:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 [L563] EXPR data->number [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [\old(prevData)={0:0}, data={-4:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\old(prevData)={0:0}, data={-4:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L563] EXPR data->number [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\old(prevData)={0:0}, data={-4:0}, prevData={0:0}, userInput=0] [L563] COND TRUE __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200 [L564] EXPR data->number [L564] data->number + __VERIFIER_nondet_int() VAL [\old(prevData)={0:0}, data={-4:0}, prevData={0:0}] - UnprovableResult [Line: 558]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 15.5s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 159 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 1651 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 222 IncrementalHoareTripleChecker+Unchecked, 1202 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 309 IncrementalHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 449 mSDtfsCounter, 309 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=9, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 92 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 305 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 311 ConstructedInterpolants, 30 QuantifiedInterpolants, 2172 SizeOfPredicates, 9 NumberOfNonLiveVariables, 730 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 100/115 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-19 10:18:21,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)