/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops/trex03-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:58:53,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:58:53,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:58:53,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:58:53,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:58:53,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:58:53,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:58:53,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:58:53,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:58:53,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:58:53,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:58:53,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:58:53,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:58:53,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:58:53,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:58:53,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:58:53,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:58:53,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:58:53,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:58:53,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:58:53,774 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:58:53,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:58:53,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:58:53,777 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:58:53,778 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:58:53,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:58:53,785 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:58:53,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:58:53,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:58:53,787 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:58:53,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:58:53,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:58:53,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:58:53,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:58:53,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:58:53,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:58:53,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:58:53,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:58:53,792 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:58:53,792 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:58:53,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:58:53,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:58:53,795 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 15:58:53,806 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:58:53,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:58:53,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:58:53,808 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:58:53,809 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:58:53,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:58:53,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:58:53,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:58:53,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:58:53,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:58:53,810 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:58:53,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:58:53,811 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:58:53,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:58:53,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:58:53,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:58:53,811 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 15:58:53,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:58:53,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:58:53,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:58:53,812 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:58:53,813 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 15:58:53,814 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 15:58:54,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:58:54,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:58:54,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:58:54,091 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:58:54,092 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:58:54,093 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/trex03-1.c [2022-04-27 15:58:54,155 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af9552ddf/a6f92fe2469f4283877892326cf292ed/FLAGd25c1dd9e [2022-04-27 15:58:54,543 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:58:54,543 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/trex03-1.c [2022-04-27 15:58:54,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af9552ddf/a6f92fe2469f4283877892326cf292ed/FLAGd25c1dd9e [2022-04-27 15:58:54,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af9552ddf/a6f92fe2469f4283877892326cf292ed [2022-04-27 15:58:54,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:58:54,562 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 15:58:54,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:58:54,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:58:54,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:58:54,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:58:54" (1/1) ... [2022-04-27 15:58:54,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5217f6fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:58:54, skipping insertion in model container [2022-04-27 15:58:54,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:58:54" (1/1) ... [2022-04-27 15:58:54,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:58:54,591 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:58:54,723 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/trex03-1.c[320,333] [2022-04-27 15:58:54,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:58:54,749 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:58:54,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/trex03-1.c[320,333] [2022-04-27 15:58:54,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:58:54,778 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:58:54,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:58:54 WrapperNode [2022-04-27 15:58:54,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:58:54,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:58:54,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:58:54,779 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:58:54,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:58:54" (1/1) ... [2022-04-27 15:58:54,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:58:54" (1/1) ... [2022-04-27 15:58:54,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:58:54" (1/1) ... [2022-04-27 15:58:54,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:58:54" (1/1) ... [2022-04-27 15:58:54,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:58:54" (1/1) ... [2022-04-27 15:58:54,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:58:54" (1/1) ... [2022-04-27 15:58:54,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:58:54" (1/1) ... [2022-04-27 15:58:54,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:58:54,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:58:54,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:58:54,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:58:54,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:58:54" (1/1) ... [2022-04-27 15:58:54,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:58:54,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:58:54,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 15:58:54,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 15:58:54,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:58:54,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:58:54,868 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:58:54,868 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 15:58:54,868 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:58:54,868 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:58:54,868 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:58:54,868 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:58:54,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:58:54,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 15:58:54,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 15:58:54,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-27 15:58:54,869 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:58:54,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:58:54,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:58:54,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:58:54,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:58:54,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:58:54,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:58:54,924 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:58:54,926 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:58:55,091 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:58:55,101 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:58:55,101 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:58:55,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:58:55 BoogieIcfgContainer [2022-04-27 15:58:55,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:58:55,104 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 15:58:55,104 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 15:58:55,108 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 15:58:55,112 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:58:55" (1/1) ... [2022-04-27 15:58:55,114 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 15:58:55,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:58:55 BasicIcfg [2022-04-27 15:58:55,139 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 15:58:55,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:58:55,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:58:55,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:58:55,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:58:54" (1/4) ... [2022-04-27 15:58:55,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@334f3348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:58:55, skipping insertion in model container [2022-04-27 15:58:55,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:58:54" (2/4) ... [2022-04-27 15:58:55,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@334f3348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:58:55, skipping insertion in model container [2022-04-27 15:58:55,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:58:55" (3/4) ... [2022-04-27 15:58:55,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@334f3348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:58:55, skipping insertion in model container [2022-04-27 15:58:55,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:58:55" (4/4) ... [2022-04-27 15:58:55,147 INFO L111 eAbstractionObserver]: Analyzing ICFG trex03-1.cJordan [2022-04-27 15:58:55,168 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:58:55,169 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:58:55,205 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:58:55,211 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4ef7a065, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@74f6ae21 [2022-04-27 15:58:55,212 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:58:55,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:58:55,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 15:58:55,226 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:58:55,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:58:55,227 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:58:55,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:58:55,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1772068984, now seen corresponding path program 1 times [2022-04-27 15:58:55,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:58:55,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248845565] [2022-04-27 15:58:55,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:58:55,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:58:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:58:55,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:58:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:58:55,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [54] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-27 15:58:55,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [57] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 15:58:55,435 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 15:58:55,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [52] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:58:55,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [54] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-27 15:58:55,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [57] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 15:58:55,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 15:58:55,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [53] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 15:58:55,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [56] mainENTRY-->L21-2: Formula: (and (= 1 v_main_~d3~0_1) (= |v_main_#t~nondet7_2| v_main_~c1~0_2) (= |v_main_#t~nondet8_2| v_main_~c2~0_1) (= 1 v_main_~d1~0_1) (= v_main_~x1~0_1 |v_main_#t~nondet4_2|) (= v_main_~x3~0_1 |v_main_#t~nondet6_2|) (= v_main_~x2~0_1 |v_main_#t~nondet5_2|) (= 1 v_main_~d2~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~d3~0=v_main_~d3~0_1, main_~d2~0=v_main_~d2~0_1, main_~d1~0=v_main_~d1~0_1, main_~x2~0=v_main_~x2~0_1, main_~x1~0=v_main_~x1~0_1, main_~c2~0=v_main_~c2~0_1, main_~x3~0=v_main_~x3~0_1} AuxVars[] AssignedVars[main_~c1~0, main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~d2~0, main_~x2~0, main_~c2~0, main_#t~nondet8, main_~d3~0, main_~d1~0, main_~x1~0, main_~x3~0] {25#true} is VALID [2022-04-27 15:58:55,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [58] L21-2-->L21-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 15:58:55,443 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} [61] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= (mod v_main_~x2~0_7 4294967296) 0) (= (mod v_main_~x3~0_7 4294967296) 0) (= (mod v_main_~x1~0_7 4294967296) 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_7, main_~x1~0=v_main_~x1~0_7, main_~x3~0=v_main_~x3~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x2~0, main_~x1~0, main_~x3~0] {26#false} is VALID [2022-04-27 15:58:55,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} [65] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID [2022-04-27 15:58:55,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [70] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 15:58:55,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [72] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 15:58:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:58:55,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:58:55,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248845565] [2022-04-27 15:58:55,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248845565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:58:55,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:58:55,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 15:58:55,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093865331] [2022-04-27 15:58:55,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:58:55,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 15:58:55,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:58:55,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:58:55,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:58:55,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 15:58:55,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:58:55,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 15:58:55,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 15:58:55,526 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:58:55,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:58:55,623 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 15:58:55,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 15:58:55,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 15:58:55,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:58:55,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:58:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-04-27 15:58:55,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:58:55,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-04-27 15:58:55,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2022-04-27 15:58:55,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:58:55,713 INFO L225 Difference]: With dead ends: 22 [2022-04-27 15:58:55,714 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 15:58:55,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 15:58:55,721 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:58:55,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:58:55,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 15:58:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 15:58:55,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:58:55,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:58:55,759 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:58:55,759 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:58:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:58:55,766 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-27 15:58:55,766 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-27 15:58:55,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:58:55,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:58:55,767 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 15:58:55,768 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 15:58:55,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:58:55,772 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-27 15:58:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-27 15:58:55,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:58:55,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:58:55,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:58:55,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:58:55,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:58:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-04-27 15:58:55,779 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2022-04-27 15:58:55,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:58:55,779 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-04-27 15:58:55,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:58:55,780 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-27 15:58:55,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 15:58:55,782 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:58:55,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:58:55,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:58:55,786 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:58:55,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:58:55,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1771145463, now seen corresponding path program 1 times [2022-04-27 15:58:55,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:58:55,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380748969] [2022-04-27 15:58:55,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:58:55,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:58:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:58:55,853 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 15:58:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:58:55,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 15:58:55,924 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 15:58:55,925 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:58:55,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:58:55,931 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 15:58:55,934 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:58:55,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:58:55 BasicIcfg [2022-04-27 15:58:55,957 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:58:55,958 INFO L158 Benchmark]: Toolchain (without parser) took 1396.00ms. Allocated memory was 183.5MB in the beginning and 234.9MB in the end (delta: 51.4MB). Free memory was 128.0MB in the beginning and 155.2MB in the end (delta: -27.3MB). Peak memory consumption was 24.2MB. Max. memory is 8.0GB. [2022-04-27 15:58:55,958 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 183.5MB. Free memory is still 144.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:58:55,959 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.38ms. Allocated memory was 183.5MB in the beginning and 234.9MB in the end (delta: 51.4MB). Free memory was 127.8MB in the beginning and 205.6MB in the end (delta: -77.8MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-04-27 15:58:55,959 INFO L158 Benchmark]: Boogie Preprocessor took 26.17ms. Allocated memory is still 234.9MB. Free memory was 205.6MB in the beginning and 204.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 15:58:55,960 INFO L158 Benchmark]: RCFGBuilder took 297.60ms. Allocated memory is still 234.9MB. Free memory was 204.0MB in the beginning and 193.0MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 15:58:55,960 INFO L158 Benchmark]: IcfgTransformer took 34.87ms. Allocated memory is still 234.9MB. Free memory was 193.0MB in the beginning and 191.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 15:58:55,960 INFO L158 Benchmark]: TraceAbstraction took 816.15ms. Allocated memory is still 234.9MB. Free memory was 190.9MB in the beginning and 155.2MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-04-27 15:58:55,962 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 183.5MB. Free memory is still 144.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.38ms. Allocated memory was 183.5MB in the beginning and 234.9MB in the end (delta: 51.4MB). Free memory was 127.8MB in the beginning and 205.6MB in the end (delta: -77.8MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.17ms. Allocated memory is still 234.9MB. Free memory was 205.6MB in the beginning and 204.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 297.60ms. Allocated memory is still 234.9MB. Free memory was 204.0MB in the beginning and 193.0MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 34.87ms. Allocated memory is still 234.9MB. Free memory was 193.0MB in the beginning and 191.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 816.15ms. Allocated memory is still 234.9MB. Free memory was 190.9MB in the beginning and 155.2MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * 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: 7]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] unsigned int x1=__VERIFIER_nondet_uint(), x2=__VERIFIER_nondet_uint(), x3=__VERIFIER_nondet_uint(); [L17] unsigned int x1=__VERIFIER_nondet_uint(), x2=__VERIFIER_nondet_uint(), x3=__VERIFIER_nondet_uint(); [L17] unsigned int x1=__VERIFIER_nondet_uint(), x2=__VERIFIER_nondet_uint(), x3=__VERIFIER_nondet_uint(); [L18] unsigned int d1=1, d2=1, d3=1; [L19] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L19] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L21] COND FALSE !(x1>0 && x2>0 && x3>0) VAL [c1=4294967301, c2=4294967299, d1=1, d2=1, d3=1, x1=0, x2=0, x3=4294967297] [L30] CALL __VERIFIER_assert(x1==0 && x2==0 && x3==0) VAL [\old(cond)=0] [L6] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L7] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 23 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 16 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 15:58:55,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...