/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/nla-digbench-scaling/freire2_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 18:44:11,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 18:44:11,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 18:44:11,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 18:44:11,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 18:44:11,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 18:44:11,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 18:44:11,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 18:44:11,187 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 18:44:11,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 18:44:11,188 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 18:44:11,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 18:44:11,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 18:44:11,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 18:44:11,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 18:44:11,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 18:44:11,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 18:44:11,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 18:44:11,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 18:44:11,193 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 18:44:11,194 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 18:44:11,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 18:44:11,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 18:44:11,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 18:44:11,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 18:44:11,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 18:44:11,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 18:44:11,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 18:44:11,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 18:44:11,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 18:44:11,203 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 18:44:11,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 18:44:11,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 18:44:11,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 18:44:11,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 18:44:11,205 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 18:44:11,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 18:44:11,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 18:44:11,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 18:44:11,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 18:44:11,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 18:44:11,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 18:44:11,212 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 18:44:11,217 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 18:44:11,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 18:44:11,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 18:44:11,218 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 18:44:11,218 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 18:44:11,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 18:44:11,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 18:44:11,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 18:44:11,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 18:44:11,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 18:44:11,219 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 18:44:11,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 18:44:11,219 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 18:44:11,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 18:44:11,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 18:44:11,219 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 18:44:11,220 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 18:44:11,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 18:44:11,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 18:44:11,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 18:44:11,220 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 18:44:11,220 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 18:44:11,220 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 18:44:11,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 18:44:11,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 18:44:11,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 18:44:11,412 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 18:44:11,413 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 18:44:11,414 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/freire2_valuebound5.c [2022-04-27 18:44:11,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/856ba4dfe/ab026dce9c3548a58f69615efaa50962/FLAG00e49644f [2022-04-27 18:44:11,787 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 18:44:11,787 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/freire2_valuebound5.c [2022-04-27 18:44:11,792 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/856ba4dfe/ab026dce9c3548a58f69615efaa50962/FLAG00e49644f [2022-04-27 18:44:12,193 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/856ba4dfe/ab026dce9c3548a58f69615efaa50962 [2022-04-27 18:44:12,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 18:44:12,196 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 18:44:12,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 18:44:12,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 18:44:12,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 18:44:12,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 06:44:12" (1/1) ... [2022-04-27 18:44:12,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5be0e2c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:12, skipping insertion in model container [2022-04-27 18:44:12,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 06:44:12" (1/1) ... [2022-04-27 18:44:12,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 18:44:12,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 18:44:12,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/freire2_valuebound5.c[709,722] [2022-04-27 18:44:12,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 18:44:12,381 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 18:44:12,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/freire2_valuebound5.c[709,722] [2022-04-27 18:44:12,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 18:44:12,403 INFO L208 MainTranslator]: Completed translation [2022-04-27 18:44:12,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:12 WrapperNode [2022-04-27 18:44:12,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 18:44:12,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 18:44:12,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 18:44:12,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 18:44:12,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:12" (1/1) ... [2022-04-27 18:44:12,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:12" (1/1) ... [2022-04-27 18:44:12,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:12" (1/1) ... [2022-04-27 18:44:12,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:12" (1/1) ... [2022-04-27 18:44:12,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:12" (1/1) ... [2022-04-27 18:44:12,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:12" (1/1) ... [2022-04-27 18:44:12,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:12" (1/1) ... [2022-04-27 18:44:12,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 18:44:12,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 18:44:12,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 18:44:12,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 18:44:12,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:12" (1/1) ... [2022-04-27 18:44:12,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 18:44:12,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 18:44:12,492 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 18:44:12,502 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 18:44:12,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 18:44:12,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 18:44:12,519 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 18:44:12,519 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 18:44:12,519 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 18:44:12,519 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 18:44:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 18:44:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 18:44:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 18:44:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 18:44:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2022-04-27 18:44:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 18:44:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 18:44:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 18:44:12,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 18:44:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 18:44:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 18:44:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 18:44:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 18:44:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 18:44:12,569 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 18:44:12,570 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 18:44:12,749 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 18:44:12,755 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 18:44:12,755 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 18:44:12,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 06:44:12 BoogieIcfgContainer [2022-04-27 18:44:12,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 18:44:12,757 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 18:44:12,757 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 18:44:12,758 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 18:44:12,761 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 06:44:12" (1/1) ... [2022-04-27 18:44:12,763 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 18:44:12,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 06:44:12 BasicIcfg [2022-04-27 18:44:12,804 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 18:44:12,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 18:44:12,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 18:44:12,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 18:44:12,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 06:44:12" (1/4) ... [2022-04-27 18:44:12,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@627d08e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 06:44:12, skipping insertion in model container [2022-04-27 18:44:12,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:12" (2/4) ... [2022-04-27 18:44:12,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@627d08e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 06:44:12, skipping insertion in model container [2022-04-27 18:44:12,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 06:44:12" (3/4) ... [2022-04-27 18:44:12,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@627d08e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 06:44:12, skipping insertion in model container [2022-04-27 18:44:12,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 06:44:12" (4/4) ... [2022-04-27 18:44:12,809 INFO L111 eAbstractionObserver]: Analyzing ICFG freire2_valuebound5.cJordan [2022-04-27 18:44:12,830 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 18:44:12,831 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 18:44:12,866 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 18:44:12,875 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@76be86c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b3d2480 [2022-04-27 18:44:12,875 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 18:44:12,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 18:44:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 18:44:12,887 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 18:44:12,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 18:44:12,888 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 18:44:12,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 18:44:12,893 INFO L85 PathProgramCache]: Analyzing trace with hash -179702132, now seen corresponding path program 1 times [2022-04-27 18:44:12,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 18:44:12,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677250962] [2022-04-27 18:44:12,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:44:12,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 18:44:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:13,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 18:44:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:13,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [74] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {34#true} is VALID [2022-04-27 18:44:13,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 18:44:13,062 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 18:44:13,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 18:44:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:13,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} [80] assume_abort_if_notENTRY-->L14: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-27 18:44:13,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [84] L14-->L14-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 18:44:13,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} [88] L14-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 18:44:13,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} [104] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and v_~someBinaryDOUBLEComparisonOperation_17 v_~someBinaryDOUBLEComparisonOperation_18) 1 0)) InVars {} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[v_~someBinaryDOUBLEComparisonOperation_17, v_~someBinaryDOUBLEComparisonOperation_18] AssignedVars[assume_abort_if_not_#in~cond] {35#false} is VALID [2022-04-27 18:44:13,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 18:44:13,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [74] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {34#true} is VALID [2022-04-27 18:44:13,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 18:44:13,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 18:44:13,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 18:44:13,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} [76] mainENTRY-->L28: Formula: (= v_main_~a~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_1, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_1, main_~s~0=v_main_~s~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~r~0, main_~a~0, main_~s~0] {34#true} is VALID [2022-04-27 18:44:13,089 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} [78] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and v_~someBinaryDOUBLEComparisonOperation_17 v_~someBinaryDOUBLEComparisonOperation_18) 1 0)) InVars {} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[v_~someBinaryDOUBLEComparisonOperation_17, v_~someBinaryDOUBLEComparisonOperation_18] AssignedVars[assume_abort_if_not_#in~cond] {34#true} is VALID [2022-04-27 18:44:13,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} [80] assume_abort_if_notENTRY-->L14: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-27 18:44:13,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} [84] L14-->L14-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 18:44:13,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} [88] L14-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 18:44:13,090 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} [104] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and v_~someBinaryDOUBLEComparisonOperation_17 v_~someBinaryDOUBLEComparisonOperation_18) 1 0)) InVars {} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[v_~someBinaryDOUBLEComparisonOperation_17, v_~someBinaryDOUBLEComparisonOperation_18] AssignedVars[assume_abort_if_not_#in~cond] {35#false} is VALID [2022-04-27 18:44:13,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} [79] L28-1-->L33-2: Formula: (and (= v_main_~r~0_4 1) (= v_main_~s~0_2 (/ 13.0 4.0)) (= v_main_~a~0_4 v_main_~x~0_2)) InVars {main_~a~0=v_main_~a~0_4} OutVars{main_~x~0=v_main_~x~0_2, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_2, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~x~0, main_~r~0, main_~s~0] {35#false} is VALID [2022-04-27 18:44:13,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} [81] L33-2-->L33-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 18:44:13,091 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} [86] L33-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ v_~convertDOUBLEToINT_13 (* (- 1) (* v_main_~r~0_11 (* v_main_~r~0_11 12)))) 1) 1 0)) InVars {main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[v_~convertDOUBLEToINT_13] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {35#false} is VALID [2022-04-27 18:44:13,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} [90] __VERIFIER_assertENTRY-->L17: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {35#false} is VALID [2022-04-27 18:44:13,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} [93] L17-->L18: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 18:44:13,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} [97] L18-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 18:44:13,092 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 18:44:13,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 18:44:13,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677250962] [2022-04-27 18:44:13,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677250962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 18:44:13,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 18:44:13,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 18:44:13,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40345574] [2022-04-27 18:44:13,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 18:44:13,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 18:44:13,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 18:44:13,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 18:44:13,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 18:44:13,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 18:44:13,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 18:44:13,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 18:44:13,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 18:44:13,143 INFO L87 Difference]: Start difference. First operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 18:44:13,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:13,261 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-27 18:44:13,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 18:44:13,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 18:44:13,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 18:44:13,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 18:44:13,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-27 18:44:13,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 18:44:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-27 18:44:13,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2022-04-27 18:44:13,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 18:44:13,336 INFO L225 Difference]: With dead ends: 31 [2022-04-27 18:44:13,336 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 18:44:13,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 18:44:13,339 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 18:44:13,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 18:44:13,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 18:44:13,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 18:44:13,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 18:44:13,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 18:44:13,358 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 18:44:13,358 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 18:44:13,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:13,361 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-27 18:44:13,361 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 18:44:13,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:44:13,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:44:13,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-27 18:44:13,362 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-27 18:44:13,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:13,364 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-27 18:44:13,364 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 18:44:13,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:44:13,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:44:13,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 18:44:13,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 18:44:13,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 18:44:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-27 18:44:13,368 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-27 18:44:13,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 18:44:13,368 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-27 18:44:13,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 18:44:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 18:44:13,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 18:44:13,369 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 18:44:13,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 18:44:13,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 18:44:13,369 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 18:44:13,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 18:44:13,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1985279762, now seen corresponding path program 1 times [2022-04-27 18:44:13,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 18:44:13,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132400692] [2022-04-27 18:44:13,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:44:13,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 18:44:13,382 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 18:44:13,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1896333827] [2022-04-27 18:44:13,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:44:13,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 18:44:13,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 18:44:13,384 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) [2022-04-27 18:44:13,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 18:44:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 18:44:13,420 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 18:44:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 18:44:13,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 18:44:13,444 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 18:44:13,444 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 18:44:13,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 18:44:13,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 18:44:13,670 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 18:44:13,672 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 18:44:13,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 06:44:13 BasicIcfg [2022-04-27 18:44:13,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 18:44:13,689 INFO L158 Benchmark]: Toolchain (without parser) took 1493.25ms. Allocated memory is still 182.5MB. Free memory was 133.5MB in the beginning and 98.6MB in the end (delta: 34.8MB). Peak memory consumption was 34.3MB. Max. memory is 8.0GB. [2022-04-27 18:44:13,689 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 18:44:13,690 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.15ms. Allocated memory is still 182.5MB. Free memory was 133.2MB in the beginning and 156.9MB in the end (delta: -23.6MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-04-27 18:44:13,690 INFO L158 Benchmark]: Boogie Preprocessor took 41.61ms. Allocated memory is still 182.5MB. Free memory was 156.9MB in the beginning and 155.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 18:44:13,690 INFO L158 Benchmark]: RCFGBuilder took 310.82ms. Allocated memory is still 182.5MB. Free memory was 155.2MB in the beginning and 144.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 18:44:13,690 INFO L158 Benchmark]: IcfgTransformer took 46.93ms. Allocated memory is still 182.5MB. Free memory was 144.3MB in the beginning and 142.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 18:44:13,691 INFO L158 Benchmark]: TraceAbstraction took 883.06ms. Allocated memory is still 182.5MB. Free memory was 142.2MB in the beginning and 98.6MB in the end (delta: 43.6MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. [2022-04-27 18:44:13,692 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.11ms. Allocated memory is still 182.5MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 200.15ms. Allocated memory is still 182.5MB. Free memory was 133.2MB in the beginning and 156.9MB in the end (delta: -23.6MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.61ms. Allocated memory is still 182.5MB. Free memory was 156.9MB in the beginning and 155.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 310.82ms. Allocated memory is still 182.5MB. Free memory was 155.2MB in the beginning and 144.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 46.93ms. Allocated memory is still 182.5MB. Free memory was 144.3MB in the beginning and 142.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 883.06ms. Allocated memory is still 182.5MB. Free memory was 142.2MB in the beginning and 98.6MB in the end (delta: 43.6MB). Peak memory consumption was 44.0MB. 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 - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_int at line 34, overapproximation of someBinaryDOUBLEComparisonOperation at line 28. Possible FailurePath: [L25] int r; [L26] double a, x, s; [L27] a = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(a>=0 && a<=5) VAL [\old(cond)=1] [L14] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume_abort_if_not(a>=0 && a<=5) VAL [a=2] [L29] x = a [L30] s = 3.25 [L31] r = 1 VAL [a=2, r=1, s=13/4, x=2] [L33] COND TRUE 1 VAL [a=2, r=1, s=13/4, x=2] [L34] CALL __VERIFIER_assert((int)(4*s) - 12*r*r == 1) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L19] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 29 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred 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, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 22 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 could not prove your program: unable to determine feasibility of some traces [2022-04-27 18:44:13,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...